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 12:36Victor MerckléVictor MerckléScore: 5,315Success
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 12:385,17212,100,3754,552,00002,113,536
2Jun 23, 2026 12:385,28812,129,1964,654,00002,113,536
3Jun 23, 2026 12:385,29012,160,8594,656,00002,113,536
4Jun 23, 2026 12:385,30212,490,0144,666,00002,113,536
5Jun 23, 2026 12:385,31512,461,1644,678,00002,113,536
6Jun 23, 2026 12:385,31512,529,1244,678,00002,113,536
7Jun 23, 2026 12:385,31712,486,2894,679,00002,113,536
8Jun 23, 2026 12:385,32312,163,6044,685,00002,113,536
9Jun 23, 2026 12:385,43012,367,9374,779,00002,113,536