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:11mmalczakmmalczakScore: 74,165Success
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:1673,99686,246,25127,378,42002,277,376
2Sep 25, 2023 22:1174,07280,999,94827,406,57102,260,992
3Sep 25, 2023 22:1674,163107,118,47227,440,47702,252,800
4Sep 25, 2023 22:1174,16599,137,80427,441,02402,277,376
5Sep 25, 2023 22:1674,373105,371,24427,518,06502,265,088
6Sep 25, 2023 22:1174,859100,760,66627,697,75902,265,088