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 15, 2021 17:30piculpiculScore: 88,954Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 17:3086,16855,972,98529,890,0001,992,0002,523,136
2Sep 15, 2021 17:3086,18955,606,08429,897,0001,993,0002,523,136
3Sep 15, 2021 17:3087,45954,589,72531,349,0001,011,0002,523,136
4Sep 15, 2021 17:3088,20062,610,37231,615,0001,019,0002,289,664
5Sep 15, 2021 17:3088,74958,715,73631,842,000995,0002,519,040
6Sep 15, 2021 17:3088,75158,173,26630,848,0001,990,0002,289,664
7Sep 15, 2021 17:3088,95455,350,94630,919,0001,994,0002,265,088
8Sep 15, 2021 17:3089,75956,061,34531,199,0002,012,0002,510,848
9Sep 15, 2021 17:3090,670111,034,47533,547,93902,260,992
10Sep 15, 2021 17:3090,98965,324,02133,666,00002,289,664
11Sep 15, 2021 17:3093,788109,221,96934,701,73302,265,088
12Sep 15, 2021 17:3094,137110,561,62334,830,85902,260,992