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:44Karthik ReddyKarthik ReddyScore: 53,810Success
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 11:1353,5006,028,929,02919,795,000020,480
2Oct 9, 2026 11:1353,5896,028,995,24719,828,000020,480
3Oct 9, 2026 11:1353,7166,029,020,26619,875,000020,480
4Oct 9, 2026 11:1353,7546,029,102,98319,889,000020,480
5Oct 9, 2026 11:1353,8106,029,144,72619,910,000020,480
6Oct 9, 2026 11:1353,8376,029,122,06919,920,000020,480
7Oct 9, 2026 11:1353,9186,029,121,01919,950,000020,480
8Oct 9, 2026 11:1354,0026,029,094,92119,981,000020,480
9Oct 9, 2026 11:1354,3246,029,279,76920,100,000020,480