Hi,

I wrote a direct translation of a simple algo from F# to ocaml.
(details can be found here:
http://khigia.wordpress.com/2008/03/30/ocaml-vs-f-for-big-integer-surprising-performance-test/
)

The compile F# program (12s) is much faster than Ocaml (30s), probably
because the algo do integer arithmetic with Int64 module (thanks to David
for this info).

Have someone here face this kind of problem (optimizing a code doing
arithmetic on big integer)?
Any advice to improve the Ocaml code (without changing the algo)?

Thanks