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 listJul 3, 2026 09:50Victor MerckléVictor MerckléScore: 4,645Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 09:534,45411,683,4083,920,00002,117,632stderr
2Jul 3, 2026 09:534,54211,670,5843,997,00002,117,632stderr
3Jul 3, 2026 09:534,55212,044,4194,006,00002,117,632stderr
4Jul 3, 2026 09:534,56111,733,4964,014,00002,117,632stderr
5Jul 3, 2026 09:534,64511,946,2504,088,00002,117,632stderr
6Jul 3, 2026 09:534,67812,173,6554,117,00002,117,632stderr
7Jul 3, 2026 09:534,86112,072,7854,278,00002,117,632stderr
8Jul 3, 2026 09:538,01114,873,9677,050,00002,117,632stderr
9Jul 3, 2026 09:538,04814,996,3347,083,00002,117,632stderr