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 17, 2026 11:27Tomislav TunkovicTomislav TunkovicScore: 3,047Success
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 11:293,03912,401,1402,675,000024,576
2Aug 17, 2026 11:293,04012,309,6362,676,000024,576
3Aug 17, 2026 11:293,04512,366,6282,680,000024,576
4Aug 17, 2026 11:293,04512,235,5052,680,000024,576
5Aug 17, 2026 11:293,04713,167,4312,682,000024,576
6Aug 17, 2026 11:293,05712,264,6802,691,000024,576
7Aug 17, 2026 11:293,05912,323,0082,692,000024,576
8Aug 17, 2026 11:293,06012,309,3842,693,000024,576
9Aug 17, 2026 11:293,07014,434,0862,702,000024,576