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 15:26Mikhail ShirokovMikhail ShirokovScore: 109,251Success
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 15:26108,12764,405,30639,007,0001,000,0002,387,968
2Sep 15, 2021 15:26108,23265,537,50238,044,0002,002,0002,519,040
3Sep 15, 2021 15:26108,34965,720,17039,087,0001,002,0002,519,040
4Sep 15, 2021 15:26108,39567,862,49438,101,0002,005,0002,396,160
5Sep 15, 2021 15:26108,51666,584,85937,140,0003,011,0002,519,040
6Sep 15, 2021 15:26108,80870,997,33440,259,00002,387,968
7Sep 15, 2021 15:26109,25166,591,81039,413,0001,010,0002,519,040
8Sep 15, 2021 15:26109,38668,077,28139,462,0001,011,0002,387,968
9Sep 15, 2021 15:26109,55171,574,14039,521,0001,013,0002,387,968
10Sep 15, 2021 15:26112,435104,993,41941,601,08902,252,800
11Sep 15, 2021 15:26112,503111,691,47641,626,15102,248,704
12Sep 15, 2021 15:26113,162108,929,48041,869,87802,240,512