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 19:43Joad 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 19:4300000Error: expected "429496530332 ", got "429495750389 "stderr
2May 6, 2024 19:4400000Error: expected "429496533561 ", got "429495706187 "stderr
3May 6, 2024 19:4500000Error: expected "429496557771 ", got "429495698441 "stderr