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 30, 2026 05:41limanjun99limanjun99Score: 65,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:4165,12748,322,11022,089,0002,008,0002,281,472
2Mar 30, 2026 05:4165,31147,095,29423,159,0001,006,0002,387,968
3Mar 30, 2026 05:4167,90052,041,31824,119,0001,004,0002,281,472