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 14, 2026 19:57Tomislav TunkovicTomislav TunkovicScore: 4,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:154,35611,895,9543,834,00002,117,632
2Aug 14, 2026 20:154,38211,888,9203,857,00002,117,632
3Aug 14, 2026 20:154,39711,839,5973,870,00002,117,632
4Aug 14, 2026 20:154,40311,929,9583,875,00002,117,632
5Aug 14, 2026 20:154,41312,715,1723,884,00002,117,632
6Aug 14, 2026 20:154,43812,763,8983,906,00002,117,632
7Aug 14, 2026 20:154,52811,970,7483,985,00002,117,632
8Aug 14, 2026 20:154,55012,855,9454,004,00002,117,632
9Aug 14, 2026 20:154,56012,085,1994,013,00002,117,632