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 18:04Tomislav TunkovicTomislav TunkovicScore: 3,082Success
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 18:093,07210,914,6292,704,000020,480
2Aug 15, 2026 18:093,07610,895,3762,707,000020,480
3Aug 15, 2026 18:093,07710,838,5442,708,000020,480
4Aug 15, 2026 18:093,07910,861,3142,710,000020,480
5Aug 15, 2026 18:093,08211,089,9272,713,000020,480
6Aug 15, 2026 18:093,09811,014,5132,727,000020,480
7Aug 15, 2026 18:093,11210,863,1122,739,000020,480
8Aug 15, 2026 18:093,12910,845,6592,754,000020,480
9Aug 15, 2026 18:093,21211,044,0722,827,000020,480