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 20:41Victor MerckléVictor MerckléScore: 2,731Success
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 20:432,72110,538,0892,395,000024,576stderr
2Sep 2, 2026 20:432,72710,519,0052,400,000024,576stderr
3Sep 2, 2026 20:432,72710,889,3032,400,000024,576stderr
4Sep 2, 2026 20:432,73010,576,3372,403,000024,576stderr
5Sep 2, 2026 20:432,73110,526,8392,404,000024,576stderr
6Sep 2, 2026 20:432,73210,533,0992,405,000024,576stderr
7Sep 2, 2026 20:432,73210,503,9052,405,000024,576stderr
8Sep 2, 2026 20:432,73810,529,9822,410,000024,576stderr
9Sep 2, 2026 20:432,75211,886,9252,422,000024,576stderr