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 11:40Karthik ReddyKarthik ReddyScore: 53,745Success
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 12:1753,6646,029,011,67519,856,000020,480
2Oct 9, 2026 12:1753,6676,029,065,59819,857,000020,480
3Oct 9, 2026 12:1753,6866,028,951,71219,864,000020,480
4Oct 9, 2026 12:1753,7026,029,097,28619,870,000020,480
5Oct 9, 2026 12:1753,7456,029,160,31219,886,000020,480
6Oct 9, 2026 12:1753,7726,029,118,74419,896,000020,480
7Oct 9, 2026 12:1753,8866,029,031,36719,938,000020,480
8Oct 9, 2026 12:1753,8916,029,131,89419,940,000020,480
9Oct 9, 2026 12:1754,2136,029,167,84620,059,000020,480