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 15:25Karthik ReddyKarthik ReddyScore: 55,040Success
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 15:4854,9106,029,345,24420,317,000020,480
2Oct 9, 2026 15:4854,9296,029,384,20020,324,000020,480
3Oct 9, 2026 15:4854,9676,029,400,75220,338,000020,480
4Oct 9, 2026 15:4855,0216,029,367,96420,358,000020,480
5Oct 9, 2026 15:4855,0406,029,418,29720,365,000020,480
6Oct 9, 2026 15:4855,0916,029,202,62820,384,000020,480
7Oct 9, 2026 15:4855,1006,029,933,79120,387,000020,480
8Oct 9, 2026 15:4855,1566,029,618,89620,408,000020,480
9Oct 9, 2026 15:4855,1976,029,371,03620,423,000020,480