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 13:56Victor MerckléVictor MerckléScore: 4,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:594,72011,990,1464,154,00002,113,536
2Jun 29, 2026 13:594,74011,903,6064,172,00002,113,536
3Jun 29, 2026 13:594,83011,875,0304,251,00002,113,536
4Jun 29, 2026 13:594,83612,255,3784,256,00002,113,536
5Jun 29, 2026 13:594,83712,246,5484,257,00002,113,536
6Jun 29, 2026 13:594,85112,005,6764,269,00002,113,536
7Jun 29, 2026 13:594,85212,291,3114,270,00002,113,536
8Jun 29, 2026 13:594,85612,275,5734,274,00002,113,536
9Jun 29, 2026 13:594,86312,340,7754,280,00002,113,536