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 listJun 30, 2026 17:34IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 17:35042,590,79327,783,0005,234,0002,113,536expected "429496547389 ", got "25515000000368 "
2Jun 30, 2026 17:35042,715,01227,581,0005,176,0002,113,536expected "429496513564 ", got "25408000000108 "
3Jun 30, 2026 17:35042,875,55827,923,0005,434,0002,113,536expected "429496499234 ", got "25439000000569 "