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 16, 2026 23:11Tomislav TunkovicTomislav TunkovicScore: 3,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:343,24410,809,2152,855,000020,480
2Aug 17, 2026 04:343,24810,735,0162,859,000020,480
3Aug 17, 2026 04:343,25311,218,3552,863,000020,480
4Aug 17, 2026 04:343,25310,683,6862,863,000020,480
5Aug 17, 2026 04:343,25410,831,6272,864,000020,480
6Aug 17, 2026 04:343,26210,886,0982,871,000020,480
7Aug 17, 2026 04:343,26910,799,9552,877,000020,480
8Aug 17, 2026 04:343,27610,839,4642,883,000020,480
9Aug 17, 2026 04:343,35610,687,9652,954,000020,480