A related fun fact. Assuming a conjecture of Tyszka, then one "only" has to search up to $10^{38.532}$ to determine if the equation has finitely many solutions.
Express the equation as a restricted form system:
$x_1=1,$
$x_3=x_2*x_2,$
$x_4=x_3*x_3$ (here $x_2$ is the $x$ in the original equation),
$x_6=x_5*x_5,$
$x_7=x_6*x_6$ (here $x_5$ is the $y$),
$x_9=x_8*x_8,$ (here $x_8$ is the $z$)
$x_{10}=x_4+x_7,$
$x_{10}=x_9+x_1$ (this pulls it all together).
This requires 10 variables, so is a subset of Tyszka's system $E_{10}$. By Tyszka's conjecture, if this system has finitely many solutions in the integers then every solution has every variable assigned a value with absolute value at most $2^{2^{n-1}}=2^{512}$. Hence $|x|^4,|y|^4,|z|^2 \le 2^{512}$ so $|x|,|y|\le 2^{128}\lt 10^{38.532}$.
Note that there is a big gap between $10^6$ and the bound given by Tyszka's conjecture. And the conjecture may also not hold... Finally, even if the conjecture does hold, there may be infinitely many solutions, but the smallest one may have $x,y>10^{38.53}$ and $z>10^{77.06}$.
The message here is just that searching the interval from $0$ to $10^6$ isn't enough.