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 listJan 19, 2025 09:33Ian MckibbenIan MckibbenScore: 70,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:3370,74353,656,36124,162,0002,013,0002,531,328
2Jan 19, 2025 09:3370,80848,471,46325,192,0001,007,0002,531,328
3Jan 19, 2025 09:3371,31944,924,68626,388,00002,269,184