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:01Huy Duc LeHuy Duc LeScore: 456,879Success
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:01456,031233,213,309168,731,36402,252,800
2Feb 22, 2024 09:01456,879232,673,139169,045,21002,256,896
3Feb 22, 2024 09:01458,150247,655,580169,515,41102,256,896