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:46Ilya AniskovetsIlya AniskovetsScore: 121,259Success
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:46119,88670,753,22042,342,0002,016,0002,289,664
2Sep 3, 2021 14:46119,88666,020,58542,342,0002,016,0002,265,088
3Sep 3, 2021 14:46120,35969,683,81143,521,0001,012,0002,289,664
4Sep 3, 2021 14:46120,45973,679,57543,558,0001,012,0002,527,232
5Sep 3, 2021 14:46120,83873,851,73243,694,0001,016,0002,289,664
6Sep 3, 2021 14:46121,17370,829,74842,842,0001,992,0002,269,184
7Sep 3, 2021 14:46121,25969,900,92543,869,000997,0002,289,664
8Sep 3, 2021 14:46121,67870,599,47943,021,0002,000,0002,531,328
9Sep 3, 2021 14:46121,75467,000,15243,047,0002,002,0002,289,664
10Sep 3, 2021 14:46123,394104,544,73145,655,86502,252,800
11Sep 3, 2021 14:46123,830117,295,74645,816,97402,269,184
12Sep 3, 2021 14:46124,300119,501,47145,990,99402,256,896