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 10:33Victor MerckléVictor MerckléScore: 4,540Success
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 10:354,41911,698,5453,889,00002,117,632stderr
2Jul 5, 2026 10:354,43011,735,7523,899,00002,117,632stderr
3Jul 5, 2026 10:354,43111,739,8033,900,00002,117,632stderr
4Jul 5, 2026 10:354,43211,777,4503,901,00002,117,632stderr
5Jul 5, 2026 10:354,54012,189,6523,996,00002,117,632stderr
6Jul 5, 2026 10:354,56212,106,0944,015,00002,117,632stderr
7Jul 5, 2026 10:354,57212,280,2124,024,00002,117,632stderr
8Jul 5, 2026 10:354,57711,833,2944,028,00002,117,632stderr
9Jul 5, 2026 10:354,65711,827,9074,099,00002,117,632stderr