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 17:52IlyaIlyaError
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 17:53044,078,89428,325,0006,085,0002,113,536expected "429496495241 ", got "25450000001013 "
2Jun 30, 2026 17:53044,454,77129,228,0005,215,0002,113,536expected "429496515289 ", got "25345000001094 "
3Jun 30, 2026 17:53043,900,21528,343,0006,064,0002,113,536expected "429496529363 ", got "25443000001043 "