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 00:34Joad NacerJoad NacerScore: 68,941Success
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 00:3468,83997,144,25625,470,32702,265,088
2May 7, 2024 00:3468,94192,981,75525,508,33002,269,184
3May 7, 2024 00:3468,98990,043,77925,525,77202,277,376