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:42TudyMTudyMScore: 35,013Success
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:4834,91850,307,13929,704,0001,024,0002,371,584
2Apr 29, 2026 13:4834,94545,674,80228,702,0002,050,0002,371,584
3Apr 29, 2026 13:4834,96845,957,20629,747,0001,025,0002,375,680
4Apr 29, 2026 13:4834,97249,865,68029,784,000992,0002,371,584
5Apr 29, 2026 13:4835,01345,240,73327,831,0002,981,0002,363,392
6Apr 29, 2026 13:4835,05447,797,76428,858,0001,990,0002,367,488
7Apr 29, 2026 13:4835,07556,595,26127,879,0002,987,0002,379,776
8Apr 29, 2026 13:4835,10645,750,50327,905,0002,989,0002,310,144
9Apr 29, 2026 13:4835,12949,606,78628,920,0001,994,0002,379,776