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 28, 2023 15:18apuxbtapuxbtError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 15:1800000Error: expected "429496448817 ", got "424298040291 "
2Sep 28, 2023 15:1800000Error: expected "429496474771 ", got "390842108571 "
3Sep 28, 2023 15:19111,70998,584,50241,332,47902,265,088
4Sep 28, 2023 15:19112,047121,622,38941,457,41802,265,088
5Sep 28, 2023 15:19112,879104,901,36241,765,21602,260,992