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:40Tomislav TunkovicTomislav TunkovicScore: 3,059Success
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:433,04710,816,7312,682,000020,480
2Aug 15, 2026 12:433,05211,226,3782,686,000020,480
3Aug 15, 2026 12:433,05410,759,8362,688,000020,480
4Aug 15, 2026 12:433,05710,869,3402,691,000020,480
5Aug 15, 2026 12:433,05910,789,2012,692,000020,480
6Aug 15, 2026 12:433,06011,385,1312,693,000020,480
7Aug 15, 2026 12:433,06210,841,4392,695,000020,480
8Aug 15, 2026 12:433,06310,885,6722,696,000020,480
9Aug 15, 2026 12:433,06810,830,9542,700,000020,480