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:08mmalczakmmalczakScore: 84,205Success
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:0882,43550,335,31329,485,0001,016,0002,289,664
2Sep 19, 2023 08:0883,37057,700,46229,852,000995,0002,273,280
3Sep 19, 2023 08:0883,45154,579,85628,885,0001,992,0002,289,664
4Sep 19, 2023 08:0883,46561,511,99328,890,0001,992,0002,269,184
5Sep 19, 2023 08:0883,47861,576,98228,895,0001,992,0002,269,184
6Sep 19, 2023 08:0884,10358,472,32530,115,0001,003,0002,289,664
7Sep 19, 2023 08:0884,20557,268,93830,151,0001,005,0002,289,664
8Sep 19, 2023 08:0884,44655,827,93829,230,0002,015,0002,269,184
9Sep 19, 2023 08:0884,52254,118,49329,256,0002,017,0002,289,664
10Sep 19, 2023 08:0885,714104,165,77731,714,05002,265,088
11Sep 19, 2023 08:0885,89796,129,39231,781,97502,265,088
12Sep 19, 2023 08:0886,427104,174,37731,977,81902,252,800