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 00:49Victor MerckléVictor MerckléScore: 3,209Success
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 00:523,11010,972,3912,737,00002,117,632stderr
2Sep 2, 2026 00:523,11210,955,3152,739,00002,117,632stderr
3Sep 2, 2026 00:523,11512,154,9022,742,00002,117,632stderr
4Sep 2, 2026 00:523,20611,012,7632,822,00002,117,632stderr
5Sep 2, 2026 00:523,20911,419,5562,824,00002,117,632stderr
6Sep 2, 2026 00:523,21410,932,4302,829,00002,117,632stderr
7Sep 2, 2026 00:523,21511,620,7802,830,00002,117,632stderr
8Sep 2, 2026 00:523,21811,072,5922,832,00002,117,632stderr
9Sep 2, 2026 00:523,23211,020,2982,845,00002,117,632stderr