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, 2021 10:33Mikhail ShirokovMikhail ShirokovScore: 106,349Success
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, 2021 10:33105,58169,687,52438,064,0001,001,0002,519,040
2Sep 16, 2021 10:33105,72466,056,60737,112,0002,006,0002,396,160
3Sep 16, 2021 10:33105,84662,946,51838,159,0001,004,0002,519,040
4Sep 16, 2021 10:33105,86565,228,54537,162,0002,008,0002,392,064
5Sep 16, 2021 10:33106,16267,183,79837,266,0002,014,0002,519,040
6Sep 16, 2021 10:33106,33861,880,34839,345,00002,519,040
7Sep 16, 2021 10:33106,34970,101,93738,341,0001,008,0002,383,872
8Sep 16, 2021 10:33106,75462,537,15538,487,0001,012,0002,519,040
9Sep 16, 2021 10:33106,76866,072,47239,504,00002,506,752
10Sep 16, 2021 10:33109,287128,494,27940,436,29602,199,552
11Sep 16, 2021 10:33109,943100,222,48540,678,94802,240,512
12Sep 16, 2021 10:33110,010110,661,45340,703,69202,244,608