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 10:06TudyMTudyMScore: 55,004Success
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 10:0854,82367,722,48747,240,0001,005,0002,326,528
2Apr 28, 2026 10:0854,84567,184,24647,259,0001,005,0002,363,392
3Apr 28, 2026 10:0854,88667,138,68947,294,0001,006,0002,371,584
4Apr 28, 2026 10:0854,96066,500,71847,336,0001,029,0002,367,488
5Apr 28, 2026 10:0855,00470,214,71346,388,0002,016,0002,326,528
6Apr 28, 2026 10:0855,00565,868,76047,397,0001,008,0002,281,472
7Apr 28, 2026 10:0855,02263,821,79246,403,0002,017,0002,379,776
8Apr 28, 2026 10:0855,07062,518,90846,443,0002,019,0002,375,680
9Apr 28, 2026 10:0855,12367,754,26147,499,0001,010,0002,375,680