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:33TudyMTudyMScore: 60,689Success
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:3460,49869,860,82352,235,0001,004,0002,371,584
2Apr 28, 2026 09:3460,50471,269,88252,240,0001,004,0002,326,528
3Apr 28, 2026 09:3460,57667,067,51951,296,0002,011,0002,371,584
4Apr 28, 2026 09:3460,66566,192,47451,372,0002,014,0002,371,584
5Apr 28, 2026 09:3460,68975,488,32052,400,0001,007,0002,326,528
6Apr 28, 2026 09:3460,71770,474,58352,423,0001,008,0002,359,296
7Apr 28, 2026 09:3460,78867,957,86752,485,0001,009,0002,310,144
8Apr 28, 2026 09:3460,80774,554,32753,511,00002,326,528
9Apr 28, 2026 09:3461,01073,281,73852,676,0001,013,0002,371,584