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 22, 2025 01:48Ian MckibbenIan MckibbenScore: 79,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 01:4878,74952,943,71228,133,0001,004,0002,531,328
2Jan 22, 2025 01:4879,57655,720,36728,428,0001,015,0002,269,184
3Jan 22, 2025 01:4879,65949,935,75729,474,00002,531,328