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 25, 2026 18:23IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 18:24038,304,46227,388,0001,213,0002,113,536expected "429496540015 ", got "4294777711 "
2Jun 25, 2026 18:24035,845,36024,898,0001,209,0002,113,536expected "429496515244 ", got "4294752940 "
3Jun 25, 2026 18:24037,544,94227,185,0001,128,0002,113,536expected "429496544606 ", got "4294782302 "