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 02:27Victor MerckléVictor MerckléScore: 3,186Success
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 02:293,07610,884,3832,707,00002,117,632stderr
2Sep 2, 2026 02:293,07710,979,8692,708,00002,117,632stderr
3Sep 2, 2026 02:293,09811,026,3162,727,00002,117,632stderr
4Sep 2, 2026 02:293,18410,957,4032,802,00002,117,632stderr
5Sep 2, 2026 02:293,18611,045,8302,804,00002,117,632stderr
6Sep 2, 2026 02:293,20210,992,0722,818,00002,117,632stderr
7Sep 2, 2026 02:293,20411,155,0002,820,00002,117,632stderr
8Sep 2, 2026 02:293,20711,010,5422,823,00002,117,632stderr
9Sep 2, 2026 02:293,21710,984,1762,831,00002,117,632stderr