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:44Victor MerckléVictor MerckléScore: 6,360Success
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:476,21512,988,1735,470,00002,113,536
2Jun 23, 2026 03:476,29813,000,4625,543,00002,113,536
3Jun 23, 2026 03:476,32613,744,7365,567,00002,113,536
4Jun 23, 2026 03:476,34413,020,0715,583,00002,113,536
5Jun 23, 2026 03:476,36013,377,4985,597,00002,113,536
6Jun 23, 2026 03:476,36413,037,1835,601,00002,113,536
7Jun 23, 2026 03:476,36513,167,0985,602,00002,113,536
8Jun 23, 2026 03:476,38713,400,0555,621,00002,113,536
9Jun 23, 2026 03:476,67913,626,7445,878,00002,113,536