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:05Victor MerckléVictor MerckléScore: 8,665Success
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:078,59714,999,2207,566,00002,113,536
2Jun 6, 2026 08:078,60014,996,4747,568,00002,113,536
3Jun 6, 2026 08:078,60114,996,4407,569,00002,113,536
4Jun 6, 2026 08:078,65615,060,3647,618,00002,113,536
5Jun 6, 2026 08:078,66515,122,6637,626,00002,113,536
6Jun 6, 2026 08:078,70915,077,5037,664,00002,113,536
7Jun 6, 2026 08:078,71415,114,4857,669,00002,113,536
8Jun 6, 2026 08:078,72215,476,9647,676,00002,113,536
9Jun 6, 2026 08:078,77315,418,8877,721,00002,113,536