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 6, 2024 21:39Joad 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 6, 2024 21:3900000Error: expected "429496481426 ", got "395136784046 "
2May 6, 2024 21:39416,561220,912,126154,127,44902,285,568
3May 6, 2024 21:39420,122219,229,739155,445,00202,289,664
4May 6, 2024 21:39420,455218,636,378155,568,22502,285,568