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 6, 2026 08:55Victor MerckléVictor MerckléScore: 7,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 08:577,70314,185,8556,779,00002,113,536
2Jun 6, 2026 08:577,70714,186,4296,783,00002,113,536
3Jun 6, 2026 08:577,71414,219,8796,789,00002,113,536
4Jun 6, 2026 08:577,78114,168,1336,848,00002,113,536
5Jun 6, 2026 08:577,80914,504,5536,872,00002,113,536
6Jun 6, 2026 08:577,82614,245,1406,887,00002,113,536
7Jun 6, 2026 08:577,83214,271,7056,893,00002,113,536
8Jun 6, 2026 08:577,84014,496,1406,900,00002,113,536
9Jun 6, 2026 08:577,88014,329,8486,935,00002,113,536