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 13:00Victor MerckléVictor MerckléScore: 3,142Success
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 13:043,03210,890,2122,669,00002,117,632stderr
2Sep 2, 2026 13:043,04610,949,7422,681,00002,117,632stderr
3Sep 2, 2026 13:043,05310,959,0362,687,00002,117,632stderr
4Sep 2, 2026 13:043,13710,957,3162,761,00002,117,632stderr
5Sep 2, 2026 13:043,14210,867,4112,765,00002,117,632stderr
6Sep 2, 2026 13:043,14711,515,3602,770,00002,117,632stderr
7Sep 2, 2026 13:043,15311,154,1622,775,00002,117,632stderr
8Sep 2, 2026 13:043,16211,530,9832,783,00002,117,632stderr
9Sep 2, 2026 13:043,16810,931,1242,788,00002,117,632stderr