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 listMay 3, 2026 19:16TudyMTudyMScore: 31,480Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:1931,39041,907,84026,562,0001,062,0002,363,392
2May 3, 2026 19:1931,40443,615,47326,579,0001,057,0002,379,776
3May 3, 2026 19:1931,43043,699,86726,609,0001,050,0002,379,776
4May 3, 2026 19:1931,46744,139,03926,632,0001,059,0002,371,584
5May 3, 2026 19:1931,48041,434,09726,636,0001,067,0002,367,488
6May 3, 2026 19:1931,50341,818,43826,659,0001,064,0002,363,392
7May 3, 2026 19:1931,51541,768,13426,661,0001,073,0002,367,488
8May 3, 2026 19:1931,52044,980,83526,661,0001,077,0002,379,776
9May 3, 2026 19:1931,61741,957,36826,754,0001,069,0002,371,584