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 27, 2026 13:54SemyonSemyonScore: 1,056,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2026 13:541,052,065949,212,391922,818,0002,999,0002,289,664
2Jan 27, 2026 13:541,052,831951,882,838924,493,0001,998,0002,469,888
3Jan 27, 2026 13:541,053,465948,360,913926,049,0001,000,0002,478,080
4Jan 27, 2026 13:541,053,800957,514,923923,343,0004,001,0002,478,080
5Jan 27, 2026 13:541,056,352958,303,613927,591,0001,999,0002,265,088
6Jan 27, 2026 13:541,056,878952,599,398928,053,0002,000,0002,523,136
7Jan 27, 2026 13:541,057,380957,718,303926,497,0003,997,0002,265,088
8Jan 27, 2026 13:541,059,313955,116,082932,195,00002,523,136
9Jan 27, 2026 13:541,063,374968,416,986932,770,0002,999,0002,523,136