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 29, 2026 13:54TudyMTudyMScore: 34,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:0333,95048,807,73027,885,0001,991,0002,306,048
2Apr 29, 2026 14:0334,06746,409,30027,981,0001,998,0002,437,120
3Apr 29, 2026 14:0334,07545,968,50827,987,0001,999,0002,375,680
4Apr 29, 2026 14:0334,11353,004,10527,018,0003,002,0002,363,392
5Apr 29, 2026 14:0334,16244,892,15628,059,0002,004,0002,367,488
6Apr 29, 2026 14:0334,18748,567,81628,080,0002,005,0002,387,968
7Apr 29, 2026 14:0334,19046,757,47827,080,0003,008,0002,441,216
8Apr 29, 2026 14:0334,29850,080,43429,177,0001,006,0002,371,584
9Apr 29, 2026 14:0334,32550,248,41328,193,0002,013,0002,363,392