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 8, 2026 22:35IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 22:36031,321,61120,469,0001,138,0002,113,536expected "429496515038 ", got "429496571905 "
2Jul 8, 2026 22:36031,330,77420,474,0001,187,0002,113,536expected "429496466542 ", got "429496554391 "
3Jul 8, 2026 22:36031,384,89720,537,0001,109,0002,113,536expected "429496531395 ", got "429496590365 "