Sum of prime numbers Andrey Tsvetkov

Compute the sum of all prime numbers in a stream of binary integers as fast as possible.

Input: 1 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of all values that are prime, printed as a decimal string.

Back to listSep 2, 2026 17:46Victor MerckléVictor MerckléScore: 2,817Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 17:492,80610,646,7002,470,000024,576stderr
2Sep 2, 2026 17:492,81111,241,5622,474,000024,576stderr
3Sep 2, 2026 17:492,81210,589,7612,475,000024,576stderr
4Sep 2, 2026 17:492,81511,296,1132,478,000024,576stderr
5Sep 2, 2026 17:492,81711,219,7032,479,000024,576stderr
6Sep 2, 2026 17:492,81812,115,2292,480,000024,576stderr
7Sep 2, 2026 17:492,81910,630,6012,481,000024,576stderr
8Sep 2, 2026 17:492,82510,635,2712,486,000024,576stderr
9Sep 2, 2026 17:492,83011,560,3232,491,000024,576stderr