TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listDec 7, 2024 18:36NoSIMD_C#NoSIMD_C#Score: 272,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 7, 2024 18:36270,849125,420,49649,105,00051,109,0002,293,760
2Dec 7, 2024 18:36271,195124,340,60954,185,00046,157,0002,465,792
3Dec 7, 2024 18:36271,470128,208,20661,271,00039,173,0002,469,888
4Dec 7, 2024 18:36271,473126,932,41478,347,00022,098,0002,473,984
5Dec 7, 2024 18:36272,041128,596,21157,373,00043,282,0002,535,424
6Dec 7, 2024 18:36273,027128,317,80766,013,00035,007,0002,449,408
7Dec 7, 2024 18:36273,032129,923,80351,011,00050,011,0002,473,984
8Dec 7, 2024 18:36276,581128,237,01960,197,00042,138,0002,465,792
9Dec 7, 2024 18:36277,892126,588,25663,888,00038,932,0002,293,760