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 20, 2023 20:02mmalczakmmalczakScore: 101,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2023 20:0286,02289,742,40231,828,04002,265,088
2Sep 20, 2023 20:0286,247102,400,88631,911,50902,260,992
3Sep 20, 2023 20:0287,28089,803,19432,293,71202,260,992
4Sep 20, 2023 20:02100,79258,923,18335,278,0002,015,0002,379,776
5Sep 20, 2023 20:02101,03260,130,50737,382,00002,527,232
6Sep 20, 2023 20:02101,70365,842,64436,613,0001,017,0002,519,040
7Sep 20, 2023 20:02101,73866,075,61736,626,0001,017,0002,527,232
8Sep 20, 2023 20:02102,28464,449,61336,850,000995,0002,289,664
9Sep 20, 2023 20:02102,31963,903,60235,866,0001,992,0002,273,280
10Sep 20, 2023 20:02102,44659,715,27536,881,0001,024,0002,273,280
11Sep 20, 2023 20:02102,86560,419,57136,057,0002,003,0002,281,472
12Sep 20, 2023 20:02102,94164,460,97336,084,0002,004,0002,289,664