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 23, 2026 01:58Victor MerckléVictor MerckléScore: 6,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 02:016,57613,319,2845,787,00002,113,536
2Jun 23, 2026 02:016,60713,306,0365,815,00002,113,536
3Jun 23, 2026 02:016,61013,365,2385,817,00002,113,536
4Jun 23, 2026 02:016,65914,053,0065,860,00002,113,536
5Jun 23, 2026 02:016,71013,713,0885,905,00002,113,536
6Jun 23, 2026 02:016,77113,415,4185,959,00002,113,536
7Jun 23, 2026 02:016,82213,484,2616,004,00002,113,536
8Jun 23, 2026 02:016,89613,883,0866,069,00002,113,536
9Jun 23, 2026 02:017,00013,654,5706,160,00002,113,536