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 listMay 26, 2024 23:22Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 23:2200000Error: expected "429496515730 ", got "145773017481 "
2May 26, 2024 23:2300000Error: expected "429496546221 ", got "147227699508 "
3May 26, 2024 23:2300000Error: expected "429496452193 ", got "160218731508 "
4May 26, 2024 23:2400000Error: expected "429496482735 ", got "102283936180 "
5May 26, 2024 23:2400000Error: expected "429496541260 ", got "131569912336 "