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 19:07Joad 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 19:0700000Error: expected "429496439311 ", got "377956895186 "
2May 7, 2024 19:0700000Error: expected "429496473203 ", got "412316624236 "
3May 7, 2024 19:0770,27899,385,03026,002,73002,260,992
4May 7, 2024 19:0770,37192,530,72026,037,22602,269,184
5May 7, 2024 19:0770,45099,042,75226,066,64602,260,992