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:09TudyMTudyMScore: 33,838Success
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 13:1033,73943,622,98328,668,0001,023,0002,379,776
2Apr 29, 2026 13:1033,78443,803,37827,680,0002,050,0002,306,048
3Apr 29, 2026 13:1033,79049,278,77929,736,00002,371,584
4Apr 29, 2026 13:1033,81744,699,84828,733,0001,026,0002,306,048
5Apr 29, 2026 13:1033,83849,236,49128,752,0001,026,0002,371,584
6Apr 29, 2026 13:1033,91144,568,68926,858,0002,984,0002,306,048
7Apr 29, 2026 13:1033,94846,205,76326,888,0002,987,0002,379,776
8Apr 29, 2026 13:1033,97546,802,80526,909,0002,989,0002,375,680
9Apr 29, 2026 13:1034,05154,506,49826,969,0002,996,0002,375,680