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 6, 2026 18:44Victor MerckléVictor MerckléScore: 3,964Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:473,84011,221,4033,380,00002,117,632stderr
2Jul 6, 2026 18:473,84511,246,5243,384,00002,117,632stderr
3Jul 6, 2026 18:473,90411,301,0183,436,00002,117,632stderr
4Jul 6, 2026 18:473,95113,139,8173,477,00002,117,632stderr
5Jul 6, 2026 18:473,96411,205,8063,489,00002,117,632stderr
6Jul 6, 2026 18:473,97811,263,8293,501,00002,117,632stderr
7Jul 6, 2026 18:473,99311,333,4303,514,00002,117,632stderr
8Jul 6, 2026 18:473,99711,350,7563,518,00002,117,632stderr
9Jul 6, 2026 18:474,11311,825,3783,620,00002,117,632stderr