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 3, 2021 14:44Ilya AniskovetsIlya AniskovetsScore: 119,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2021 14:44118,62467,552,67841,896,0001,995,0002,289,664
2Sep 3, 2021 14:44118,81667,041,08141,964,0001,998,0002,289,664
3Sep 3, 2021 14:44118,91972,845,49543,000,0001,000,0002,527,232
4Sep 3, 2021 14:44118,93566,005,18942,006,0002,000,0002,510,848
5Sep 3, 2021 14:44119,03068,007,81842,040,0002,001,0002,289,664
6Sep 3, 2021 14:44119,19266,044,12543,099,0001,002,0002,289,664
7Sep 3, 2021 14:44119,23873,182,36442,113,0002,005,0002,289,664
8Sep 3, 2021 14:44119,24172,061,80142,114,0002,005,0002,289,664
9Sep 3, 2021 14:44119,25770,706,11542,120,0002,005,0002,289,664
10Sep 3, 2021 14:44121,599112,835,20444,991,50502,256,896
11Sep 3, 2021 14:44121,940104,251,03745,117,87902,260,992
12Sep 3, 2021 14:44122,073118,347,22245,166,95902,256,896