Product of matrix logics is shown to preserve a slightly relaxed notion of Craig interpolation. The symbolic proof capitalizes on the complete axiomatization of the product of matrix logics provided by meet-combination. The computation of the interpolant in the resulting logic is proved to be polynomially reducible to the computation of the interpolants in the two given logics. Illustrations are provided for classical, intuitionistic and modal propositional logics.