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 22:03IlyaIlyaError
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 22:04031,378,51420,676,0001,145,0002,113,536expected "429496537273 ", got "429496700872 "
2Jun 30, 2026 22:04031,213,58120,635,0001,093,0002,113,536expected "429496546702 ", got "429496704868 "
3Jun 30, 2026 22:04031,217,21320,594,0001,108,0002,113,536expected "429496493207 ", got "429496701886 "