Isn't Haskell's "Int" an arbitrary-sized integer, while C's "int" is... like, whatever the compiler makes of it, typically a 32 or 64 bit int?
With the ackermann function, it's not obvious that the compiler can proof a lack of overflow, and optimize out the bigint-ness.
Since I can't see the graphs, I don't know what input ranges the author used, and thus can't tell if the C version even gave the correct answer.