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 15:38Victor MerckléVictor MerckléScore: 3,147Success
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 15:433,02910,886,8752,666,00002,117,632stderr
2Sep 2, 2026 15:433,14011,520,3742,764,00002,117,632stderr
3Sep 2, 2026 15:433,14011,534,3322,764,00002,117,632stderr
4Sep 2, 2026 15:433,14311,500,7092,766,00002,117,632stderr
5Sep 2, 2026 15:433,14711,538,5282,770,00002,117,632stderr
6Sep 2, 2026 15:433,16811,571,3992,788,00002,117,632stderr
7Sep 2, 2026 15:433,23216,841,5962,845,00002,117,632stderr
8Sep 2, 2026 15:433,24420,350,8972,855,00002,117,632stderr
9Sep 2, 2026 15:433,36818,838,2671,952,0001,012,0002,117,632stderr