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 5, 2026 02:41Victor MerckléVictor MerckléScore: 4,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 02:434,47811,743,3203,941,00002,117,632stderr
2Jul 5, 2026 02:434,49311,760,3833,954,00002,117,632stderr
3Jul 5, 2026 02:434,49811,773,0833,959,00002,117,632stderr
4Jul 5, 2026 02:434,50111,767,7563,961,00002,117,632stderr
5Jul 5, 2026 02:434,61911,789,5444,065,00002,117,632stderr
6Jul 5, 2026 02:434,62212,120,9074,068,00002,117,632stderr
7Jul 5, 2026 02:434,62811,838,2564,073,00002,117,632stderr
8Jul 5, 2026 02:434,63412,215,0754,078,00002,117,632stderr
9Jul 5, 2026 02:434,63911,925,6654,083,00002,117,632stderr