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 listOct 9, 2026 08:17Karthik ReddyKarthik ReddyScore: 53,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:2853,7296,029,087,16119,880,000020,480
2Oct 9, 2026 09:2853,7946,029,111,73219,904,000020,480
3Oct 9, 2026 09:2853,8816,029,062,91519,936,000020,480
4Oct 9, 2026 09:2853,9246,029,119,31819,952,000020,480
5Oct 9, 2026 09:2853,9356,029,001,41119,956,000020,480
6Oct 9, 2026 09:2854,0106,029,111,61919,984,000020,480
7Oct 9, 2026 09:2854,0276,029,176,58219,990,000020,480
8Oct 9, 2026 09:2854,1516,029,161,14320,036,000020,480
9Oct 9, 2026 09:2854,5756,029,391,16719,180,0001,013,00020,480