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 listAug 14, 2026 20:32Tomislav TunkovicTomislav TunkovicScore: 4,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:433,99511,452,5643,516,00002,113,536
2Aug 14, 2026 20:433,99611,346,9313,517,00002,113,536
3Aug 14, 2026 20:434,00611,384,3593,526,00002,113,536
4Aug 14, 2026 20:434,00711,410,6983,527,00002,113,536
5Aug 14, 2026 20:434,01011,549,1203,529,00002,113,536
6Aug 14, 2026 20:434,01312,305,4293,532,00002,113,536
7Aug 14, 2026 20:434,02012,282,4843,538,00002,113,536
8Aug 14, 2026 20:434,02612,316,8843,543,00002,113,536
9Aug 14, 2026 20:434,03212,020,0933,549,00002,113,536