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:13IlyaIlyaError
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:13011,751,0181,168,0001,217,0002,121,728expected "429496525005 ", got "429495910400 "
2Jun 30, 2026 11:13011,710,9991,152,0001,179,0002,121,728expected "429496485814 ", got "429495912528 "
3Jun 30, 2026 11:13011,690,5451,149,0001,208,0002,121,728expected "429496476511 ", got "429495910400 "