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 4, 2026 03:37olliecrowolliecrowScore: 529,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:37527,708222,526,321193,250,0002,002,0002,514,944
2Mar 4, 2026 03:37529,857220,761,737191,046,0005,001,0002,400,256
3Mar 4, 2026 03:37532,297225,431,475194,951,0001,999,0002,293,760