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 listSep 16, 2023 10:36mmalczakmmalczakScore: 99,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2023 10:3697,94959,438,75934,228,0002,013,0002,289,664
2Sep 16, 2023 10:3698,01462,744,66834,251,0002,014,0002,289,664
3Sep 16, 2023 10:3698,74361,060,70135,521,0001,014,0002,289,664
4Sep 16, 2023 10:3698,76559,588,98235,528,0001,015,0002,273,280
5Sep 16, 2023 10:3698,93261,584,27335,589,0001,016,0002,523,136
6Sep 16, 2023 10:3699,21667,108,36035,691,0001,019,0002,289,664
7Sep 16, 2023 10:3699,680122,173,74636,881,72702,252,800
8Sep 16, 2023 10:3699,71158,280,49934,899,0001,994,0002,289,664
9Sep 16, 2023 10:36100,79567,949,68535,279,0002,015,0002,289,664
10Sep 16, 2023 10:36100,86261,023,99535,302,0002,017,0002,289,664
11Sep 16, 2023 10:36101,159101,509,24537,428,90602,265,088
12Sep 16, 2023 10:36102,630117,478,90637,973,01802,265,088