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 20, 2026 07:51A_ShamanA_ShamanError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 07:52010,547,04101,555,0002,121,728expected "429496526698 ", got "0 "
2Jun 20, 2026 07:52010,958,53101,581,0002,121,728expected "429496510024 ", got "0 "
3Jun 20, 2026 07:52010,480,30101,551,0002,121,728expected "429496505434 ", got "0 "