We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Hmmm I'm having trouble in getting 100% passed.
TImeout for TC 1, 7 & 8 while all the others are running fine in 0.9 or 1s (It takes me 0.9s to generate 20M primes )
I can get an answer for 10**12 quite fast I guess, but can't handle 10 LARGE entries, as I'm sure at least one of those TC do this.
Can't find a way to memo results as my algorithm is made for just one N at a time
Project Euler #50: Consecutive prime sum
You are viewing a single comment's thread. Return to all comments →
Hmmm I'm having trouble in getting 100% passed. TImeout for TC 1, 7 & 8 while all the others are running fine in 0.9 or 1s (It takes me 0.9s to generate 20M primes )
I can get an answer for 10**12 quite fast I guess, but can't handle 10 LARGE entries, as I'm sure at least one of those TC do this.
Can't find a way to memo results as my algorithm is made for just one N at a time
My Python 3 code had the same issue for Test Case #1, 7, 8. Time limit exceeded.
Ran it using Pypy 3 compiler and passed all cases.