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 09:50Mikhail ShirokovMikhail ShirokovScore: 106,568Success
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 09:50105,56264,576,75838,057,0001,001,0002,519,040
2Sep 16, 2021 09:50105,73267,228,79936,112,0003,009,0002,383,872
3Sep 16, 2021 09:50105,73867,674,82738,120,0001,003,0002,519,040
4Sep 16, 2021 09:50105,85167,287,82837,157,0002,008,0002,383,872
5Sep 16, 2021 09:50105,94665,880,04637,190,0002,010,0002,519,040
6Sep 16, 2021 09:50106,10064,846,27938,251,0001,006,0002,519,040
7Sep 16, 2021 09:50106,56865,694,26938,419,0001,011,0002,519,040
8Sep 16, 2021 09:50106,91465,619,95038,544,0001,014,0002,519,040
9Sep 16, 2021 09:50107,18166,789,00439,657,00002,519,040
10Sep 16, 2021 09:50109,022105,870,60840,338,07102,244,608
11Sep 16, 2021 09:50109,428107,486,62840,488,50002,244,608
12Sep 16, 2021 09:50109,813110,528,49540,630,67702,252,800