These statements about trusting the compiler and using efficient algorithms are misguided. Fast code requires profiling to see where the time is actually spent, and theoretically inefficient algorithms are often better in practice (example: quicksort beats radix sort on most real-world inputs).

But you're right to some degree in this case, and I do wonder how those Haskell implementations manage to optimize that.