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 21, 2024 15:37Huy Duc LeHuy Duc LeScore: 429,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2024 15:37428,047216,412,250158,377,54102,293,760
2Feb 21, 2024 15:37429,708215,976,630158,991,91502,301,952
3Feb 21, 2024 15:37431,163223,742,531159,530,29102,183,168