Re: [Haskell-cafe] how to make haskell faster than python at finding primes?

Alex:

The challenge was the implement the modcount algorithm not to calculate primes per se. (see e.g. http://jjinux.blogspot.com/2005/11/io-comparison.html).

Can you show us the Python code? Paulo