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 29, 2026 17:22Victor MerckléVictor MerckléScore: 4,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 17:254,62711,782,2774,072,00002,113,536
2Jun 29, 2026 17:254,63411,796,3194,078,00002,113,536
3Jun 29, 2026 17:254,67112,233,6474,111,00002,113,536
4Jun 29, 2026 17:254,73011,824,2404,163,00002,113,536
5Jun 29, 2026 17:254,73011,809,2594,163,00002,113,536
6Jun 29, 2026 17:254,74812,105,4674,179,00002,113,536
7Jun 29, 2026 17:254,76812,127,9274,196,00002,113,536
8Jun 29, 2026 17:254,80111,936,9414,225,00002,113,536
9Jun 29, 2026 17:254,83111,897,3294,252,00002,113,536