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:16olliecrowolliecrowScore: 101,768Success
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:16101,28463,411,74936,463,0001,012,0002,437,120
2Mar 20, 2026 19:16101,76867,066,84935,619,0002,035,0002,342,912
3Mar 20, 2026 19:16103,55964,555,78536,301,0002,016,0002,445,312