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:56Tomislav TunkovicTomislav TunkovicScore: 3,948Success
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:073,87512,768,8613,410,00002,113,536
2Aug 14, 2026 21:073,88511,355,2853,419,00002,113,536
3Aug 14, 2026 21:073,89311,492,8683,426,00002,113,536
4Aug 14, 2026 21:073,91711,466,7533,447,00002,113,536
5Aug 14, 2026 21:073,94811,471,9783,475,00002,113,536
6Aug 14, 2026 21:073,96511,542,4413,490,00002,113,536
7Aug 14, 2026 21:073,97912,186,4273,502,00002,113,536
8Aug 14, 2026 21:073,99511,498,9183,516,00002,113,536
9Aug 14, 2026 21:074,00211,528,4153,522,00002,113,536