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 19, 2023 08:03mmalczakmmalczakScore: 84,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2023 08:0383,36854,659,24028,856,0001,990,0002,289,664
2Sep 19, 2023 08:0383,43558,107,82628,880,0001,991,0002,527,232
3Sep 19, 2023 08:0383,67855,326,56028,964,0001,997,0002,289,664
4Sep 19, 2023 08:0383,94353,487,87029,056,0002,003,0002,289,664
5Sep 19, 2023 08:0383,95960,448,36829,061,0002,004,0002,289,664
6Sep 19, 2023 08:0383,96257,969,03829,062,0002,004,0002,289,664
7Sep 19, 2023 08:0384,13857,419,14730,127,0001,004,0002,289,664
8Sep 19, 2023 08:0384,75759,237,00629,337,0002,023,0002,289,664
9Sep 19, 2023 08:0384,79258,723,71029,349,0002,024,0002,289,664
10Sep 19, 2023 08:0385,85297,045,73131,765,30202,260,992
11Sep 19, 2023 08:0386,176127,273,08331,885,01902,252,800
12Sep 19, 2023 08:0386,502111,710,44332,005,57502,269,184