Hash multiple integers directly using FNV-1a
It's not equivalent, and I suspect there will be a loss of statistical randomization/mixing.

The core step that offers mixing of the bits is multiplication by FNV_PRIME modulo $2^{32}$.  The original version (operating on bytes) does this once for each byte of the input.  The alternative version (operating on integers) does this once for each integer, i.e., once for each four bytes.  Thus, the alternative version does only one-fourth as many of these mixing operations.

For these reasons, I anticipate that the alternative version will provide poorer mixing of the bits and might offer poorer statistical properties or weaker collision resistance.

For instance, here is one weakness of the alternative version that isn't present in the original version.  Suppose you simultaneously flip the high bit of i and j.  Then it turns out that the output (the hash value) will remain unchanged, with the alternative version.  This is a weakness in a hash function.  The original version doesn't have this weakness: there's no simple set of bit flips you can do to the input that will have a similar effect.  This is a result of the fact that the alternative version only does the multiplication-based mixing one-fourth as much as the original version.

Now, don't take this the wrong way.  This doesn't necessarily mean that the alternative version is flawed or useless.  The alternative version might still be good enough for applications; that will depend on the distribution of integers that you hash and the needs of the particular application.  But you can't make an equivalence argument that it's "just as good" as the original version.