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 08:14Victor MerckléVictor MerckléScore: 5,829Success
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 08:175,71812,545,9925,032,00002,113,536
2Jun 23, 2026 08:175,73912,601,9425,051,00002,113,536
3Jun 23, 2026 08:175,80312,549,2195,107,00002,113,536
4Jun 23, 2026 08:175,82912,599,9175,130,00002,113,536
5Jun 23, 2026 08:175,82912,627,1465,130,00002,113,536
6Jun 23, 2026 08:175,84212,629,8965,141,00002,113,536
7Jun 23, 2026 08:175,85014,356,3915,148,00002,113,536
8Jun 23, 2026 08:175,88012,587,6315,175,00002,113,536
9Jun 23, 2026 08:176,08512,859,5205,355,00002,113,536