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:03Huy Duc LeHuy Duc LeScore: 221,992Success
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:03221,729148,775,45582,039,67902,232,320
2Feb 22, 2024 09:03221,992169,166,86382,137,03902,203,648
3Feb 22, 2024 09:03222,006137,311,89682,142,13102,236,416