Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Disclaimer: I’m working on Euler Problem 9.
I’m adding up some pretty large numbers, all the primes from 1 to 2 000 000.
Summing those primes takes forever. I’m using the haskell built in function ‘sum’.
as in:
sum listOfPrimes
Are there any other faster options?
–My prime generator was the slow link in my code.
It sounds like your problem is not summing the numbers, but generating them. What is your implementation of listOfPrimes?
This paper may be of interest: http://lambda-the-ultimate.org/node/3127