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 25, 2026 22:21IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:22033,168,41522,179,0001,219,0002,113,536expected "429496488039 ", got "429496484441 "
2Jun 25, 2026 22:2262,85932,948,43322,037,0001,221,0002,113,536
3Jun 25, 2026 22:2264,56733,214,32522,682,0001,208,0002,113,536