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:26TudyMTudyMScore: 31,354Success
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:2931,28642,269,76926,473,0001,059,0002,367,488
2May 3, 2026 19:2931,30741,463,31626,484,0001,067,0002,375,680
3May 3, 2026 19:2931,31941,129,56926,499,0001,062,0002,379,776
4May 3, 2026 19:2931,34843,916,36026,510,0001,077,0002,375,680
5May 3, 2026 19:2931,35442,244,84126,527,0001,065,0002,367,488
6May 3, 2026 19:2931,37345,917,63726,552,0001,057,0002,367,488
7May 3, 2026 19:2931,39644,552,31326,551,0001,078,0002,375,680
8May 3, 2026 19:2931,40941,761,70626,577,0001,063,0002,375,680
9May 3, 2026 19:2931,41541,161,11726,574,0001,072,0002,375,680