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:41Joad NacerJoad NacerScore: 428,058Success
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:41427,564211,749,662158,198,69902,293,760
2May 6, 2024 19:41428,058222,265,417158,381,39302,297,856
3May 6, 2024 19:41432,984235,263,762160,204,08602,293,760