The condition $f(x) | g(x), x \in \mathbb{Z}$ can be interpreted as the equation
$$\displaystyle g(x) = yf(x), x,y \in \mathbb{Z}.$$
This evidently defines an algebraic plane curve, of degree $d = \max\{\deg f, \deg g\}$. One can apply the determinant method to get a good bound which is best possible in general. The version due to Bombieri and Pila does not seem to work well with skew boxes if I recall, but the affine version due to Heath-Brown does work. In this case, we suppose that $|x| \asymp B$ and hence $|y| \ll \frac{|g(x)|}{|f(x)|} \ll B^{\deg g - \deg f} = B^k$, say. We may assume that $k \geq 1$, otherwise the result is easier. Put $\deg g = d_1, \deg f = d_2$, and
$$\displaystyle V = \exp \left(\frac{(\log B)(\log B^{k})}{\log(B^{d_1})} \right) = B^{\frac{k}{d_1}}.$$
Then it is a theorem of Heath-Brown (see equation (3) in Browning's paper: Power-free values of polynomials) that the number of solutions is bounded by
$$\displaystyle O_\varepsilon \left(B^{\frac{k}{d_1} + \varepsilon} \right).$$
Evidently the exponent is less than one for $\varepsilon$ sufficiently small.