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 listApr 28, 2026 09:31TudyMTudyMScore: 60,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:3260,64270,720,40452,359,0001,006,0002,371,584
2Apr 28, 2026 09:3260,68071,932,43752,392,0001,007,0002,363,392
3Apr 28, 2026 09:3260,71268,046,41851,411,0002,016,0002,318,336
4Apr 28, 2026 09:3260,74369,629,83651,437,0002,017,0002,375,680
5Apr 28, 2026 09:3260,81273,853,98552,506,0001,009,0002,326,528
6Apr 28, 2026 09:3260,85073,290,69551,528,0002,020,0002,363,392
7Apr 28, 2026 09:3260,86372,010,27252,550,0001,010,0002,375,680
8Apr 28, 2026 09:3260,90968,271,60051,578,0002,022,0002,375,680
9Apr 28, 2026 09:3260,99871,668,60852,667,0001,012,0002,359,296