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 15:09Josu San MartinJosu San MartinScore: 20,365Success
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 15:0920,20144,348,69917,777,00002,453,504
2Jan 17, 2026 15:0920,30642,916,52215,884,0001,985,0002,523,136
3Jan 17, 2026 15:0920,34342,455,17514,919,0002,983,0002,523,136
4Jan 17, 2026 15:0920,35942,022,15617,916,00002,453,504
5Jan 17, 2026 15:0920,36536,383,96116,926,000995,0002,527,232
6Jan 17, 2026 15:0920,43144,600,49215,982,0001,997,0002,527,232
7Jan 17, 2026 15:0920,44038,968,39115,989,0001,998,0002,449,408
8Jan 17, 2026 15:0920,68341,512,25116,179,0002,022,0002,453,504
9Jan 17, 2026 15:0920,75938,309,59316,239,0002,029,0002,342,912