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:24Ian MckibbenIan MckibbenScore: 73,511Success
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:2473,32747,760,83826,127,0001,004,0002,269,184
2Jan 25, 2025 00:2473,51150,606,33426,192,0001,007,0002,428,928
3Jan 25, 2025 00:2473,78451,370,51825,278,0002,022,0002,433,024