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 listApr 30, 2026 13:42Charles CabergsCharles CabergsError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 13:42019,703,85301,555,0002,355,200expected "429496487996 ", got "1 "stderr
2Apr 30, 2026 13:42022,191,47301,676,0002,420,736expected "429496504009 ", got "1 "stderr
3Apr 30, 2026 13:42024,821,56501,573,0002,359,296expected "429496519682 ", got "1 "stderr