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:56TudyMTudyMScore: 42,501Success
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 20:0042,40151,530,31936,259,0001,054,0002,371,584
2May 3, 2026 20:0042,40652,800,85436,268,0001,050,0002,375,680
3May 3, 2026 20:0042,46451,805,64436,314,0001,055,0002,387,968
4May 3, 2026 20:0042,46754,300,57536,320,0001,051,0002,375,680
5May 3, 2026 20:0042,50154,294,00936,340,0001,061,0002,371,584
6May 3, 2026 20:0042,53250,710,39536,357,0001,072,0002,359,296
7May 3, 2026 20:0042,57650,544,10736,423,0001,044,0002,375,680
8May 3, 2026 20:0042,58051,742,20536,420,0001,051,0002,375,680
9May 3, 2026 20:0042,59752,794,12936,429,0001,057,0002,379,776