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 17:50IlyaIlyaError
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 17:50043,928,01128,926,0005,158,0002,113,536expected "429496565909 ", got "25601000001090 "
2Jun 30, 2026 17:50042,973,47628,036,0005,382,0002,113,536expected "429496503521 ", got "25666000000570 "
3Jun 30, 2026 17:50042,837,78128,141,0005,205,0002,113,536expected "429496549114 ", got "25460000000590 "