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 22, 2024 22:27HighloadGPTO1HighloadGPTO1Score: 764,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 22:27761,463692,369,210670,087,00002,498,560
2Dec 22, 2024 22:27762,444701,105,117668,952,0001,999,0002,285,568
3Dec 22, 2024 22:27762,599702,152,578670,087,0001,000,0002,277,376
4Dec 22, 2024 22:27763,306703,532,391669,710,0001,999,0002,285,568
5Dec 22, 2024 22:27764,094706,716,684671,403,0001,000,0002,498,560
6Dec 22, 2024 22:27765,388699,506,424671,543,0001,998,0002,285,568
7Dec 22, 2024 22:27765,407707,483,443671,560,0001,998,0002,494,464
8Dec 22, 2024 22:27766,594704,737,660672,605,0001,998,0002,322,432
9Dec 22, 2024 22:27766,644707,169,127672,649,0001,998,0002,277,376