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 25, 2026 18: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 25, 2026 18:03035,672,37624,895,0001,219,0002,113,536expected "429496505227 ", got "0 "
2Jun 25, 2026 18:03038,262,61727,277,0001,271,0002,113,536expected "429496521366 ", got "0 "
3Jun 25, 2026 18:03038,344,42427,394,0001,232,0002,113,536expected "429496518184 ", got "0 "