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 11:10Victor MerckléVictor MerckléScore: 3,144Success
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 11:123,04210,996,1842,677,00002,117,632stderr
2Sep 2, 2026 11:123,04710,951,8032,682,00002,117,632stderr
3Sep 2, 2026 11:123,04710,902,9602,682,00002,117,632stderr
4Sep 2, 2026 11:123,13911,568,9692,763,00002,117,632stderr
5Sep 2, 2026 11:123,14410,905,7532,767,00002,117,632stderr
6Sep 2, 2026 11:123,14611,511,8192,769,00002,117,632stderr
7Sep 2, 2026 11:123,14611,000,0002,769,00002,117,632stderr
8Sep 2, 2026 11:123,16011,561,7762,781,00002,117,632stderr
9Sep 2, 2026 11:123,20211,159,5942,818,00002,117,632stderr