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 01:00Joad NacerJoad NacerScore: 71,645Success
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 01:0071,01697,158,01326,275,78802,260,992
2May 7, 2024 01:0071,64591,114,84826,508,53802,269,184
3May 7, 2024 01:0071,65485,382,00726,512,04702,285,568