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:09Ian MckibbenIan MckibbenScore: 71,070Success
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:0970,80547,821,19925,191,0001,007,0002,531,328
2Jan 22, 2025 01:0971,07048,719,01825,285,0001,011,0002,433,024
3Jan 22, 2025 01:0971,21647,922,96126,350,00002,531,328