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 listFeb 22, 2024 03:55Huy Duc LeHuy Duc LeScore: 165,049Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 03:55164,579119,143,55660,894,36202,293,760
2Feb 22, 2024 03:55165,049126,954,37661,068,23802,285,568
3Feb 22, 2024 03:55166,112122,441,87161,461,40302,285,568