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:12Victor MerckléVictor MerckléScore: 4,643Success
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:154,58211,829,9284,033,00002,113,536
2Jun 29, 2026 17:154,61511,761,2444,062,00002,113,536
3Jun 29, 2026 17:154,62611,790,6534,071,00002,113,536
4Jun 29, 2026 17:154,63011,835,8634,075,00002,113,536
5Jun 29, 2026 17:154,64311,832,0664,086,00002,113,536
6Jun 29, 2026 17:154,75011,831,4194,180,00002,113,536
7Jun 29, 2026 17:154,76012,166,8904,189,00002,113,536
8Jun 29, 2026 17:154,77211,820,3584,200,00002,113,536
9Jun 29, 2026 17:155,01212,423,4464,411,00002,113,536