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 20, 2026 15:36Johan SannemoJohan SannemoScore: 9,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2026 15:019,79226,044,6056,463,0002,154,0002,498,560
2Jan 20, 2026 15:019,79726,701,3308,621,00002,490,368
3Jan 20, 2026 15:369,80525,817,8647,550,0001,078,0002,494,464
4Jan 20, 2026 15:369,87526,619,2766,518,0002,172,0002,285,568
5Jan 20, 2026 15:369,93627,843,8317,651,0001,093,0002,289,664
6Jan 20, 2026 15:0110,00124,080,8196,601,0002,200,0002,502,656