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:32IlyaIlyaError
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:32042,844,60028,112,0005,198,0002,113,536expected "429496545661 ", got "50 "
2Jun 30, 2026 17:32042,982,95227,957,0005,451,0002,113,536expected "429496604254 ", got "40 "
3Jun 30, 2026 17:32042,688,00928,014,0005,181,0002,113,536expected "429496532696 ", got "57 "