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 1, 2026 03:46Victor MerckléVictor MerckléScore: 4,852Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 03:494,69011,995,2944,128,00002,117,632stderr
2Jul 1, 2026 03:494,78111,951,7304,208,00002,117,632stderr
3Jul 1, 2026 03:494,82911,883,3234,250,00002,117,632stderr
4Jul 1, 2026 03:494,85011,973,7854,268,00002,117,632stderr
5Jul 1, 2026 03:494,85211,926,3584,270,00002,117,632stderr
6Jul 1, 2026 03:494,86211,948,4474,279,00002,117,632stderr
7Jul 1, 2026 03:494,87112,243,6124,287,00002,117,632stderr
8Jul 1, 2026 03:494,88011,989,1214,295,00002,117,632stderr
9Jul 1, 2026 03:495,06312,130,7724,456,00002,117,632stderr