You want $10^{13}\leq y\leq 10^{14}$, so obviously $10^{26}\leq y^2\leq 10^{28}$. The range of $x$ for which your expression $10^{26}\leq y^2 = 2213326116 + 94098\ x\ (1 + x) (-31363 + 31366\ x)\leq 10^{28}$ can be easily found:
N@Reduce[10^26 < 2213326116 + 94098 x (1 + x) (-31363 + 31366 x) <= 10^28, x]
323584. < x <= 1.50194*10^6
That's not a huge range; we can brute-force test all values of $x$ in that range, and we can do that in parallel, e.g. using ParallelDo:
ParallelTable[
If[
IntegerQ@Sqrt[2213326116 + 94098 x (1 + x) (-31363 + 31366 x)],
x, Nothing
],
{x, 300000, 1600000}
]
This is not exactly fast, but it does finish within two minutes on my 4-core machine, whereas your Solve expression was still chugging away after a couple of minutes. This is an embarrassingly parallel operation, i.e. it suffers from no interdependence or communication overhead, so it should see a nice boost from extensive parallelization on many kernels.
Unfortunately, however, it appears that there are no results in that range that this method could find.
Solveis, obviously, non-trivial. However, in answering your previous question from which you got this code, Roman proposed an alternative toSolveusing a brute-force approach. Have you tried it here? – MarcoB Jan 08 '20 at 21:37