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 14:46Victor MerckléVictor MerckléScore: 4,852Success
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 14:494,73811,875,2124,170,00002,113,536
2Jun 29, 2026 14:494,75311,987,0964,183,00002,113,536
3Jun 29, 2026 14:494,84212,202,1664,261,00002,113,536
4Jun 29, 2026 14:494,85011,897,5284,268,00002,113,536
5Jun 29, 2026 14:494,85211,942,9734,270,00002,113,536
6Jun 29, 2026 14:494,86212,017,9974,279,00002,113,536
7Jun 29, 2026 14:494,88112,001,1064,296,00002,113,536
8Jun 29, 2026 14:494,92211,993,0354,332,00002,113,536
9Jun 29, 2026 14:494,98412,388,2784,386,00002,113,536