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 16:20mmalczakmmalczakScore: 117,368Success
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 16:20115,77368,028,73641,840,000996,0002,289,664
2Sep 16, 2023 16:20115,84374,217,60041,866,000996,0002,289,664
3Sep 16, 2023 16:20115,95968,215,69341,908,000997,0002,265,088
4Sep 16, 2023 16:20116,39765,627,83642,066,0001,001,0002,289,664
5Sep 16, 2023 16:20116,67069,395,19941,161,0002,007,0002,289,664
6Sep 16, 2023 16:20117,02270,013,60742,292,0001,006,0002,531,328
7Sep 16, 2023 16:20117,36866,216,18242,417,0001,009,0002,289,664
8Sep 16, 2023 16:20117,41667,107,32542,434,0001,010,0002,289,664
9Sep 16, 2023 16:20120,825120,682,40244,705,34802,273,280
10Sep 16, 2023 16:20121,552110,099,89544,974,28402,273,280
11Sep 16, 2023 16:20122,036106,508,47245,153,16402,260,992
12Sep 16, 2023 16:20126,95770,532,48844,976,0001,998,0002,289,664