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 01:38Victor MerckléVictor MerckléScore: 3,205Success
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 01:413,11310,950,6332,740,00002,117,632stderr
2Sep 2, 2026 01:413,11511,054,4532,742,00002,117,632stderr
3Sep 2, 2026 01:413,11710,969,4832,743,00002,117,632stderr
4Sep 2, 2026 01:413,20211,508,3512,818,00002,117,632stderr
5Sep 2, 2026 01:413,20511,060,5192,821,00002,117,632stderr
6Sep 2, 2026 01:413,21010,992,6122,825,00002,117,632stderr
7Sep 2, 2026 01:413,22210,990,9712,836,00002,117,632stderr
8Sep 2, 2026 01:413,22711,070,7472,840,00002,117,632stderr
9Sep 2, 2026 01:413,23010,977,3182,843,00002,117,632stderr