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 23:48Joad NacerJoad NacerScore: 419,037Success
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 23:48417,063231,908,155154,313,36902,293,760
2May 6, 2024 23:48419,037211,784,986155,043,80202,297,856
3May 6, 2024 23:48419,229223,377,285155,114,66202,301,952