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 07:54Ian MckibbenIan MckibbenScore: 71,389Success
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 07:5471,08451,723,32925,290,0001,011,0002,428,928
2Jan 19, 2025 07:5471,38948,036,36826,414,00002,437,120
3Jan 19, 2025 07:5471,40547,780,35125,404,0001,016,0002,269,184