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 listMar 20, 2026 19:32olliecrowolliecrowScore: 101,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 19:32100,81459,581,10335,285,0002,016,0002,445,312
2Mar 20, 2026 19:32101,53862,302,25035,539,0002,030,0002,342,912
3Mar 20, 2026 19:32102,40564,509,82335,896,0001,994,0002,342,912