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 listJun 29, 2026 23:58Victor MerckléVictor MerckléScore: 4,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 00:014,60111,785,2904,049,00002,117,632stderr
2Jun 30, 2026 00:014,61011,758,2254,057,00002,117,632stderr
3Jun 30, 2026 00:014,61911,799,7954,065,00002,117,632stderr
4Jun 30, 2026 00:014,62211,788,3564,068,00002,117,632stderr
5Jun 30, 2026 00:014,62311,853,6474,069,00002,117,632stderr
6Jun 30, 2026 00:014,70711,867,7384,143,00002,117,632stderr
7Jun 30, 2026 00:014,71911,799,6654,153,00002,117,632stderr
8Jun 30, 2026 00:014,74611,831,5084,177,00002,117,632stderr
9Jun 30, 2026 00:014,74812,065,4634,179,00002,117,632stderr