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:45Victor MerckléVictor MerckléScore: 3,386Success
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:483,37311,234,2402,969,00002,117,632stderr
2Sep 2, 2026 02:483,37611,219,1102,971,00002,117,632stderr
3Sep 2, 2026 02:483,37811,278,1062,973,00002,117,632stderr
4Sep 2, 2026 02:483,38011,188,8122,975,00002,117,632stderr
5Sep 2, 2026 02:483,38611,224,0342,980,00002,117,632stderr
6Sep 2, 2026 02:483,48511,878,4223,067,00002,117,632stderr
7Sep 2, 2026 02:483,48612,456,7983,068,00002,117,632stderr
8Sep 2, 2026 02:483,49611,864,5783,077,00002,117,632stderr
9Sep 2, 2026 02:483,51411,278,5573,093,00002,117,632stderr