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:26IlyaIlyaError
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:26036,753,05123,882,0003,303,0002,113,536expected "429496533999 ", got "97074850824541 "
2Jun 30, 2026 17:26037,055,27324,465,0003,055,0002,113,536expected "429496547710 ", got "97581656965651 "
3Jun 30, 2026 17:26036,870,82024,321,0003,031,0002,113,536expected "429496497519 ", got "97809290232204 "