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

ptanimoto:

I haven't tried any of those codes, but Don did you notice you're calculating 1,000 primes while Alex was talking about 10,000?

Yeah, I tested both with 1k and 10k :)