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 10:18Karthik ReddyKarthik ReddyScore: 53,772Success
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 10:2653,6756,028,969,34419,860,000020,480
2Oct 9, 2026 10:2653,7026,029,017,07219,870,000020,480
3Oct 9, 2026 10:2653,7106,028,976,39719,873,000020,480
4Oct 9, 2026 10:2653,7516,028,990,82119,888,000020,480
5Oct 9, 2026 10:2653,7726,029,098,51519,896,000020,480
6Oct 9, 2026 10:2653,8356,030,516,73819,919,000020,480
7Oct 9, 2026 10:2653,8376,029,133,78519,920,000020,480
8Oct 9, 2026 10:2653,9916,029,177,29419,977,000020,480
9Oct 9, 2026 10:2654,2216,029,217,77220,062,000020,480