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 listApr 20, 2026 19:24Pavel SkripkinPavel SkripkinScore: 1,405,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 19:251,373,3171,232,909,8971,206,520,0001,999,0002,269,184
2Apr 20, 2026 19:251,374,1971,233,501,5621,208,295,000999,0002,260,992
3Apr 20, 2026 19:251,383,4721,250,115,2321,215,457,0001,999,0002,355,200
4Apr 20, 2026 19:251,402,8271,260,560,5001,233,489,000999,0002,260,992
5Apr 20, 2026 19:251,405,2311,258,522,0901,234,605,0001,999,0002,416,640
6Apr 20, 2026 19:251,415,2461,278,112,7021,243,418,0001,999,0002,359,296
7Apr 20, 2026 19:251,418,5131,264,159,1501,248,292,00002,273,280
8Apr 20, 2026 19:251,432,1891,283,533,4651,258,329,0001,998,0002,359,296
9Apr 20, 2026 19:251,433,5211,288,341,9711,260,500,000999,0002,363,392