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 20:59Tomislav TunkovicTomislav TunkovicScore: 3,919Success
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:103,83011,387,4083,371,00002,113,536
2Aug 14, 2026 21:103,83411,413,7463,374,00002,113,536
3Aug 14, 2026 21:103,84011,469,9803,380,00002,113,536
4Aug 14, 2026 21:103,90511,346,0303,437,00002,113,536
5Aug 14, 2026 21:103,91911,380,1863,449,00002,113,536
6Aug 14, 2026 21:103,92011,512,6003,450,00002,113,536
7Aug 14, 2026 21:103,92011,505,5713,450,00002,113,536
8Aug 14, 2026 21:103,92311,478,4603,453,00002,113,536
9Aug 14, 2026 21:103,92711,387,4453,456,00002,113,536