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 18, 2023 12:59mmalczakmmalczakScore: 84,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 18, 2023 12:5983,39558,714,55029,861,000995,0002,289,664
2Sep 18, 2023 12:5983,43862,654,82628,881,0001,991,0002,289,664
3Sep 18, 2023 12:5983,65453,326,94928,956,0001,996,0002,527,232
4Sep 18, 2023 12:5983,65952,618,89028,957,0001,997,0002,527,232
5Sep 18, 2023 12:5984,07052,960,65629,100,0002,006,0002,273,280
6Sep 18, 2023 12:5984,18958,956,15529,141,0002,009,0002,531,328
7Sep 18, 2023 12:5984,25951,889,90429,165,0002,011,0002,285,568
8Sep 18, 2023 12:5984,47356,161,55329,239,0002,016,0002,269,184
9Sep 18, 2023 12:5984,47652,570,07329,240,0002,016,0002,289,664
10Sep 18, 2023 12:5985,60492,958,04331,673,61002,269,184
11Sep 18, 2023 12:5985,99696,728,25731,818,59102,260,992
12Sep 18, 2023 12:5986,389103,523,47831,963,92602,269,184