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 15, 2026 12:33Tomislav TunkovicTomislav TunkovicScore: 3,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 12:363,05910,902,0092,692,000020,480
2Aug 15, 2026 12:363,06010,861,7622,693,000020,480
3Aug 15, 2026 12:363,06410,761,2882,697,000020,480
4Aug 15, 2026 12:363,07611,418,0862,707,000020,480
5Aug 15, 2026 12:363,07810,830,5202,709,000020,480
6Aug 15, 2026 12:363,08210,869,4412,713,000020,480
7Aug 15, 2026 12:363,09410,801,8362,723,000020,480
8Aug 15, 2026 12:363,13811,448,9692,762,000020,480
9Aug 15, 2026 12:363,14210,906,6062,765,000020,480