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 16:34IlyaIlyaError
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 16:35031,786,92121,163,0001,143,0002,113,536expected "429496516354 ", got "3241 "
2Jun 30, 2026 16:35031,617,68620,954,0001,185,0002,113,536expected "429496437264 ", got "2588 "
3Jun 30, 2026 16:35031,620,42320,937,0001,205,0002,113,536expected "429496518636 ", got "2036 "