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 03:07Victor MerckléVictor MerckléScore: 6,779Success
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 03:106,71313,402,2175,908,00002,113,536
2Jun 23, 2026 03:106,75713,706,5135,947,00002,113,536
3Jun 23, 2026 03:106,77013,418,3005,958,00002,113,536
4Jun 23, 2026 03:106,77313,403,4435,961,00002,113,536
5Jun 23, 2026 03:106,77922,078,7135,966,00002,113,536
6Jun 23, 2026 03:106,80213,475,3995,986,00002,113,536
7Jun 23, 2026 03:106,80913,753,8105,992,00002,113,536
8Jun 23, 2026 03:106,86013,473,8216,037,00002,113,536
9Jun 23, 2026 03:106,98813,600,4746,150,00002,113,536