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 09:02Huy Duc LeHuy Duc LeScore: 259,499Success
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 09:02259,370153,668,89595,966,72702,252,800
2Feb 22, 2024 09:02259,499171,510,69196,014,58602,260,992
3Feb 22, 2024 09:02259,728153,319,18296,099,51702,256,896