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 5, 2026 12:40Victor MerckléVictor MerckléScore: 9,552Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 12:429,47515,824,4468,338,00002,113,536
2Jun 5, 2026 12:429,49815,868,9888,359,00002,113,536
3Jun 5, 2026 12:429,52617,204,8978,383,00002,113,536
4Jun 5, 2026 12:429,54615,853,9328,401,00002,113,536
5Jun 5, 2026 12:429,55215,876,8588,406,00002,113,536
6Jun 5, 2026 12:429,55215,804,7398,406,00002,113,536
7Jun 5, 2026 12:429,57720,226,6198,428,00002,113,536
8Jun 5, 2026 12:429,61015,916,7778,457,00002,113,536
9Jun 5, 2026 12:429,61915,901,2048,465,00002,113,536