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 listFeb 22, 2024 03:22Huy Duc LeHuy Duc LeScore: 76,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:2276,60851,461,67126,321,0002,024,0002,494,464
2Feb 22, 2024 03:2276,68951,693,19726,349,0002,026,0002,494,464
3Feb 22, 2024 03:2276,77349,574,69127,392,0001,014,0002,486,272
4Feb 22, 2024 03:2276,84954,548,82525,388,0003,046,0002,281,472
5Feb 22, 2024 03:2276,90555,953,26128,455,00002,490,368
6Feb 22, 2024 03:2276,95154,986,26827,456,0001,016,0002,281,472
7Feb 22, 2024 03:2276,99752,200,59927,472,0001,017,0002,498,560
8Feb 22, 2024 03:2277,01650,914,19326,461,0002,035,0002,281,472
9Feb 22, 2024 03:2277,37658,877,11925,562,0003,067,0002,281,472
10Feb 22, 2024 03:2281,040128,355,27929,984,87202,220,032
11Feb 22, 2024 03:2281,15994,652,21430,028,98402,228,224
12Feb 22, 2024 03:2281,43482,810,93530,130,68002,228,224