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 11:15IlyaIlyaError
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 11:15041,337,81623,135,0001,028,0002,117,632expected "429496513690 ", got "429495910400 "
2Jun 30, 2026 11:15045,335,37921,869,0001,116,0002,113,536expected "429496540251 ", got "429495910400 "
3Jun 30, 2026 11:15031,080,99720,449,0001,119,0002,113,536expected "429496472216 ", got "429495910400 "