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 25, 2025 00:13Ian MckibbenIan MckibbenScore: 70,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 00:1369,91152,824,71125,867,00002,428,928
2Jan 25, 2025 00:1370,34947,688,93124,027,0002,002,0002,428,928
3Jan 25, 2025 00:1370,55149,417,36625,100,0001,004,0002,437,120