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 26, 2026 07:01IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:02023,496,55812,512,0001,240,0002,113,536expected "429496549949 ", got "429496548278 "
2Jun 26, 2026 07:02022,935,42812,517,0001,211,0002,113,536expected "429496531746 ", got "429496536833 "
3Jun 26, 2026 07:02023,097,03612,589,0001,222,0002,113,536expected "429496518213 ", got "429496466264 "