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 6, 2022 15:07Eugene ZhydzetskiEugene ZhydzetskiScore: 112,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2022 15:07110,73063,566,79438,972,0001,998,0002,334,720
2Sep 6, 2022 15:07111,11166,816,26440,109,0001,002,0002,514,944
3Sep 6, 2022 15:07111,23861,565,15039,151,0002,007,0002,514,944
4Sep 6, 2022 15:07111,33268,123,55040,189,0001,004,0002,519,040
5Sep 6, 2022 15:07111,35965,435,19339,194,0002,009,0002,523,136
6Sep 6, 2022 15:07111,38969,860,66540,209,0001,005,0002,334,720
7Sep 6, 2022 15:07112,02764,427,36841,450,00002,334,720
8Sep 6, 2022 15:07112,04966,298,87840,447,0001,011,0002,519,040
9Sep 6, 2022 15:07112,29564,116,75641,549,00002,519,040
10Sep 6, 2022 15:07112,893105,216,67341,770,46302,174,976
11Sep 6, 2022 15:07113,97096,158,34742,168,77502,191,360
12Sep 6, 2022 15:07114,13099,847,89742,228,17402,179,072