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 16:39IlyaIlyaError
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 16:39031,433,19520,785,0001,143,0002,113,536expected "429496546086 ", got "1360 "
2Jun 30, 2026 16:39031,345,55720,709,0001,080,0002,113,536expected "429496539946 ", got "1343 "
3Jun 30, 2026 16:39031,314,44320,742,0001,108,0002,113,536expected "429496513758 ", got "1373 "