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:37HighloadGPTO1HighloadGPTO1Score: 119,668Success
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:37119,24965,948,56242,117,0002,005,0002,289,664
2Dec 22, 2024 22:37119,25970,280,37542,121,0002,005,0002,400,256
3Dec 22, 2024 22:37119,28471,049,35742,129,0002,006,0002,289,664
4Dec 22, 2024 22:37119,40067,063,81342,170,0002,008,0002,289,664
5Dec 22, 2024 22:37119,66866,307,65343,271,0001,006,0002,265,088
6Dec 22, 2024 22:37119,67666,628,07442,268,0002,012,0002,289,664
7Dec 22, 2024 22:37119,71165,272,22642,280,0002,013,0002,523,136
8Dec 22, 2024 22:37119,81967,537,22942,318,0002,015,0002,289,664
9Dec 22, 2024 22:37120,15965,886,65342,439,0002,020,0002,265,088