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 1, 2026 23:36Victor MerckléVictor MerckléScore: 3,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 23:473,04210,895,8852,677,00002,117,632stderr
2Sep 1, 2026 23:473,04610,932,7202,681,00002,117,632stderr
3Sep 1, 2026 23:473,04710,945,8102,682,00002,117,632stderr
4Sep 1, 2026 23:473,05010,947,5792,684,00002,117,632stderr
5Sep 1, 2026 23:473,07910,899,0552,710,00002,117,632stderr
6Sep 1, 2026 23:473,15711,580,3612,779,00002,117,632stderr
7Sep 1, 2026 23:473,16711,600,4132,787,00002,117,632stderr
8Sep 1, 2026 23:473,17611,618,2282,795,00002,117,632stderr
9Sep 1, 2026 23:473,25111,057,6172,861,00002,117,632stderr