This is the most efficient possible implementation, as given appropriate hardware it returns in constant time even for really large arrays. All other solutions are at least O(n).

Eh, no, actually. With Θ (n²) processors, you can solve this in Ο (log n) time. And that's with off-the-self processors, not some hardware which is unlikely to be ever build.

Abigail