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 listJul 7, 2026 13:12IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 13:12033,215,56621,943,0001,071,0002,113,536expected "429496506609 ", got "429496502838 "
2Jul 7, 2026 13:1261,28332,304,03921,544,0001,131,0002,113,536
3Jul 7, 2026 13:1261,55632,473,73321,488,0001,288,0002,113,536