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 listJan 17, 2026 02:25mgildermgilderScore: 195,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 02:25192,667193,266,097168,544,0001,003,0002,367,488
2Jan 17, 2026 02:25193,205202,570,747169,020,0001,000,0002,289,664
3Jan 17, 2026 02:25193,347192,349,211168,144,0002,001,0002,289,664
4Jan 17, 2026 02:25194,530193,814,464170,185,0001,001,0002,289,664
5Jan 17, 2026 02:25195,319197,946,068170,882,000999,0002,289,664
6Jan 17, 2026 02:25195,601197,789,010171,129,0001,000,0002,359,296
7Jan 17, 2026 02:25195,956196,540,395171,439,0001,002,0002,363,392
8Jan 17, 2026 02:25196,025197,405,837171,500,0001,002,0002,359,296
9Jan 17, 2026 02:25196,642195,457,487171,045,0002,000,0002,289,664