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:49zielajzielajScore: 3,395Success
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:493,33921,139,9581,959,000979,0002,273,280
2Jan 17, 2026 02:493,36117,551,0681,972,000986,0002,392,064
3Jan 17, 2026 02:493,36626,215,0181,975,000987,0002,535,424
4Jan 17, 2026 02:493,37217,778,6041,978,000989,0002,277,376
5Jan 17, 2026 02:493,39518,679,232996,0001,992,0002,400,256
6Jan 17, 2026 02:493,58021,342,4332,100,0001,050,0002,392,064
7Jan 17, 2026 02:493,74421,830,4093,295,00002,535,424
8Jan 17, 2026 02:493,78022,604,8903,326,00002,392,064
9Jan 17, 2026 02:494,21322,214,6063,707,00002,535,424