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 22, 2024 22:33HighloadGPTO1HighloadGPTO1Score: 143,403Success
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:33142,67384,879,14450,797,0001,992,0002,273,280
2Dec 22, 2024 22:33143,21980,013,55850,992,0001,999,0002,269,184
3Dec 22, 2024 22:33143,23077,680,17549,996,0002,999,0002,277,376
4Dec 22, 2024 22:33143,31483,168,50851,025,0002,001,0002,523,136
5Dec 22, 2024 22:33143,40384,701,06551,057,0002,002,0002,273,280
6Dec 22, 2024 22:33143,55783,291,25850,110,0003,006,0002,367,488
7Dec 22, 2024 22:33143,60878,217,70351,130,0002,005,0002,277,376
8Dec 22, 2024 22:33144,87383,033,48952,592,0001,011,0002,277,376
9Dec 22, 2024 22:33144,97379,549,70651,616,0002,024,0002,523,136