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 21:41Tomislav TunkovicTomislav TunkovicScore: 3,652Success
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 21:453,62811,306,9063,193,00002,113,536
2Aug 14, 2026 21:453,63911,268,3353,203,00002,113,536
3Aug 14, 2026 21:453,63911,329,7543,203,00002,113,536
4Aug 14, 2026 21:453,64211,350,3903,205,00002,113,536
5Aug 14, 2026 21:453,65211,325,7863,214,00002,113,536
6Aug 14, 2026 21:453,72211,355,6963,276,00002,113,536
7Aug 14, 2026 21:453,73511,350,3523,287,00002,113,536
8Aug 14, 2026 21:453,79019,396,7433,336,00002,113,536
9Aug 14, 2026 21:453,80511,410,8453,349,00002,113,536