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 21:10Tomislav TunkovicTomislav TunkovicScore: 3,867Success
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 21:143,79511,772,1113,340,00002,113,536
2Aug 14, 2026 21:143,79811,302,6613,343,00002,113,536
3Aug 14, 2026 21:143,80011,399,8653,344,00002,113,536
4Aug 14, 2026 21:143,80211,453,0993,346,00002,113,536
5Aug 14, 2026 21:143,86711,433,7463,403,00002,113,536
6Aug 14, 2026 21:143,86813,445,7823,404,00002,113,536
7Aug 14, 2026 21:143,87211,346,3883,408,00002,113,536
8Aug 14, 2026 21:143,90112,737,9093,433,00002,113,536
9Aug 14, 2026 21:144,01811,714,7563,536,00002,113,536