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 03:03Victor MerckléVictor MerckléScore: 3,173Success
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 03:073,05710,964,2422,691,00002,117,632stderr
2Sep 2, 2026 03:073,06210,922,4392,695,00002,117,632stderr
3Sep 2, 2026 03:073,06211,283,6362,695,00002,117,632stderr
4Sep 2, 2026 03:073,08610,940,9372,716,00002,117,632stderr
5Sep 2, 2026 03:073,17310,977,9812,793,00002,117,632stderr
6Sep 2, 2026 03:073,17610,979,2982,795,00002,117,632stderr
7Sep 2, 2026 03:073,17710,980,2942,796,00002,117,632stderr
8Sep 2, 2026 03:073,18110,877,9622,800,00002,117,632stderr
9Sep 2, 2026 03:073,20110,971,0332,817,00002,117,632stderr