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:44IlyaIlyaError
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:44045,509,99729,218,0005,213,0002,113,536expected "429496534298 ", got "25670000000962 "
2Jun 30, 2026 17:44044,569,38728,474,0006,121,0002,113,536expected "429496484693 ", got "25478000001087 "
3Jun 30, 2026 17:44043,961,56928,375,0006,089,0002,113,536expected "429496520177 ", got "25420000001054 "