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 10:12IlyaIlyaError
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 10:13032,217,46521,610,0001,124,00016,384No answer to stdout. Died or killed?
2Jun 30, 2026 10:1362,37232,604,37521,956,0001,122,0002,113,536
3Jun 30, 2026 10:1362,47232,659,54922,085,0001,030,0002,113,536