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 7, 2024 00:26Joad 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 7, 2024 00:2600000Error: expected "429496475196 ", got "339302218164 "
2May 7, 2024 00:2600000Error: expected "429496487935 ", got "395136758520 "
3May 7, 2024 00:2700000Error: expected "429496483099 ", got "317827410500 "
4May 7, 2024 00:2700000Error: expected "429496474725 ", got "343597176083 "
5May 7, 2024 00:2800000Error: expected "429496499255 ", got "429496460131 "
6May 7, 2024 00:2800000Error: expected "429496568835 ", got "429496539259 "