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 22, 2026 11:48Josu San MartinJosu San MartinScore: 6,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 11:516,88713,535,5226,061,00002,113,536
2Jun 22, 2026 11:516,89013,620,6146,064,00002,113,536
3Jun 22, 2026 11:516,92213,953,6086,092,00002,113,536
4Jun 22, 2026 11:516,92514,006,5256,094,00002,113,536
5Jun 22, 2026 11:516,93113,718,3416,100,00002,113,536
6Jun 22, 2026 11:516,93613,633,7936,104,00002,113,536
7Jun 22, 2026 11:517,12214,124,2026,268,00002,113,536
8Jun 22, 2026 11:517,21114,229,7776,346,00002,113,536
9Jun 22, 2026 11:518,80215,265,6107,746,00002,113,536