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:40Joad 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:4000000Error: expected "429496466573 ", got "420906541911 "
2May 6, 2024 19:40417,239236,512,090154,378,37402,285,568
3May 6, 2024 19:40417,823217,497,406154,594,54802,297,856
4May 6, 2024 19:40418,121236,503,455154,704,93102,289,664