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:44Tomislav TunkovicTomislav TunkovicScore: 3,117Success
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:493,08010,810,6852,711,000020,480
2Aug 15, 2026 12:493,08011,189,0122,711,000020,480
3Aug 15, 2026 12:493,08110,850,4702,712,000020,480
4Aug 15, 2026 12:493,08211,430,8252,713,000020,480
5Aug 15, 2026 12:493,11710,872,5192,743,000020,480
6Aug 15, 2026 12:493,12310,851,2282,749,000020,480
7Aug 15, 2026 12:493,13410,901,3962,758,000020,480
8Aug 15, 2026 12:493,13711,458,7992,761,000020,480
9Aug 15, 2026 12:493,22111,535,7322,835,000020,480