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 23:28Joad NacerJoad NacerScore: 68,345Success
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 23:2868,10982,800,62625,200,47202,269,184
2May 7, 2024 23:2868,34596,754,06625,287,73802,265,088
3May 7, 2024 23:2868,78585,018,79525,450,27302,265,088