StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POOptimize Haskell code calculating the sum of all the primes below two million
primarykey
Id
4378194
data
AcceptedAnswerId
4378252
AnswerCount
3
ClosedDate
CommentCount
3
CommunityOwnedDate
CreationDate
2010-12-07T15:13:43.517
FavoriteCount
1
LastActivityDate
2017-06-17T20:58:22.737
LastEditDate
2017-06-17T20:58:22.737
LastEditorUserId
1073386
OwnerUserId
410160
ParentId
0
PostTypeId
1
Score
3
ViewCount
834
LastEditorDisplayName
text
Body
Problem 10 in Project Euler. I saw some discussion there but only for C. I used the following code to calculate: <pre><code>print . sum . sieve $ [2..2000000] where sieve [] = [] sieve (x:xs) = x : sieve (filter ((/= 0) . (`mod` x)) xs) </code></pre> It takes ages to calculate. I am wondering if there is any more efficient way to calculate it?
Tags
<haskell><optimization><primes>
Title
Optimize Haskell code calculating the sum of all the primes below two million
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USAdam Stelmaszczyk
UserOwnerUserId
1. USswcai
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. PL
 singulars
 LinkTypeLinkTypeId
 LTLinked
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POOptimize Haskell code calculating the sum of all the primes below two million
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 POOptimize Haskell code calculating the sum of all the primes below two million
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 POOptimize Haskell code calculating the sum of all the primes below two million
 UserUserId
 USswcai
 VoteTypeVoteTypeId
 VTFavorite
CommentsPostId
1. COAlso, a typo: you have `seive` instead of `sieve`.
 singulars
 PostPostId
 POOptimize Haskell code calculating the sum of all the primes below two million
 UserUserId
 USAntal Spector-Zabusky
2. COUpdated. Thanks Antal.
 singulars
 PostPostId
 POOptimize Haskell code calculating the sum of all the primes below two million
 UserUserId
 USswcai

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.