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:36Tomislav TunkovicTomislav TunkovicScore: 3,704Success
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:403,68011,426,7433,239,00002,113,536
2Aug 14, 2026 21:403,68911,270,1593,247,00002,113,536
3Aug 14, 2026 21:403,68911,205,2413,247,00002,113,536
4Aug 14, 2026 21:403,69811,248,2803,255,00002,113,536
5Aug 14, 2026 21:403,70411,286,7413,260,00002,113,536
6Aug 14, 2026 21:403,70511,292,0663,261,00002,113,536
7Aug 14, 2026 21:403,71111,219,6353,266,00002,113,536
8Aug 14, 2026 21:403,74011,320,2713,292,00002,113,536
9Aug 14, 2026 21:403,79411,413,0963,339,00002,113,536