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 16, 2023 11:15mmalczakmmalczakScore: 98,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 16, 2023 11:1597,68959,272,59036,145,00002,371,584
2Sep 16, 2023 11:1597,81962,384,81634,183,0002,010,0002,265,088
3Sep 16, 2023 11:1597,83859,511,83735,195,0001,005,0002,527,232
4Sep 16, 2023 11:1598,16859,455,11334,305,0002,017,0002,289,664
5Sep 16, 2023 11:1598,34359,055,44835,377,0001,010,0002,289,664
6Sep 16, 2023 11:1598,40360,678,65334,387,0002,022,0002,269,184
7Sep 16, 2023 11:1598,73867,293,93236,533,00002,289,664
8Sep 16, 2023 11:1598,87669,702,83235,568,0001,016,0002,289,664
9Sep 16, 2023 11:1599,10361,407,90136,668,00002,289,664
10Sep 16, 2023 11:15100,059106,298,24537,021,86002,273,280
11Sep 16, 2023 11:15100,080106,746,46337,029,59702,269,184
12Sep 16, 2023 11:15100,749102,670,49637,277,20702,269,184