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 listDec 26, 2025 00:35vahookvahookScore: 5,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 00:355,83121,384,3614,105,0001,026,0002,535,424
2Dec 26, 2025 00:355,85517,655,4644,122,0001,030,0002,383,872
3Dec 26, 2025 00:355,86025,756,9794,126,0001,031,0002,273,280
4Dec 26, 2025 00:355,86427,801,1053,096,0002,064,0002,469,888
5Dec 26, 2025 00:355,87623,498,6614,137,0001,034,0002,473,984
6Dec 26, 2025 00:355,91021,904,5453,121,0002,080,0002,412,544
7Dec 26, 2025 00:355,91119,622,9603,121,0002,081,0002,535,424
8Dec 26, 2025 00:355,94021,520,5303,136,0002,091,0002,535,424
9Dec 26, 2025 00:356,08623,402,2715,356,00002,330,624