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 02:10Ian MckibbenIan MckibbenScore: 69,922Success
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 02:1069,88653,365,45325,858,00002,531,328
2Jan 22, 2025 02:1069,92255,688,84223,881,0001,990,0002,433,024
3Jan 22, 2025 02:1070,10350,871,27923,943,0001,995,0002,433,024