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 24, 2026 23:20IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:2108,078,606,4987,899,907,000169,260,0002,113,536expected "429496491364 ", got "425201528375 "
2Jun 24, 2026 23:2108,019,029,0477,840,281,000168,915,0002,113,536expected "429496537278 ", got "425201573824 "
3Jun 24, 2026 23:2108,086,034,4627,906,344,000170,090,0002,113,536expected "429496505660 ", got "425201542776 "