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 25, 2023 22:07mmalczakmmalczakScore: 74,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2023 22:0873,69090,797,78827,265,33802,211,840
2Sep 25, 2023 22:0773,93692,233,73927,356,25502,252,800
3Sep 25, 2023 22:0974,09296,213,53727,414,18702,260,992
4Sep 25, 2023 22:0774,18192,855,79027,446,86102,265,088
5Sep 25, 2023 22:0774,229104,138,59927,464,68502,273,280
6Sep 25, 2023 22:0774,399105,022,02027,527,62302,260,992
7Sep 25, 2023 22:0874,43384,997,39527,540,05002,273,280
8Sep 25, 2023 22:0974,44094,882,10327,542,76802,256,896
9Sep 25, 2023 22:0974,503104,893,84627,565,92502,265,088
10Sep 25, 2023 22:0774,50697,726,73327,567,03502,265,088
11Sep 25, 2023 22:0874,69185,793,31227,635,61702,269,184
12Sep 25, 2023 22:0774,78781,286,84027,671,12902,265,088