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:02Victor MerckléVictor MerckléScore: 4,704Success
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:054,58211,744,9374,033,00002,113,536
2Jun 29, 2026 17:054,62011,789,0974,066,00002,113,536
3Jun 29, 2026 17:054,69211,822,6294,129,00002,113,536
4Jun 29, 2026 17:054,70411,829,1144,140,00002,113,536
5Jun 29, 2026 17:054,70411,796,5634,140,00002,113,536
6Jun 29, 2026 17:054,72312,156,0334,157,00002,113,536
7Jun 29, 2026 17:054,72312,117,4554,157,00002,113,536
8Jun 29, 2026 17:054,73411,854,9054,166,00002,113,536
9Jun 29, 2026 17:054,87611,965,8774,291,00002,113,536