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 19, 2026 22:19e1011e1011Score: 568,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 22:20566,456220,574,32870,751,000138,838,0002,113,536
2Oct 19, 2026 22:20566,727220,814,37470,633,000139,056,0002,113,536
3Oct 19, 2026 22:20567,064221,014,31270,819,000138,995,0002,113,536
4Oct 19, 2026 22:20567,078220,937,56070,762,000139,057,0002,113,536
5Oct 19, 2026 22:20568,218221,213,85170,715,000139,526,0002,113,536
6Oct 19, 2026 22:20569,570221,712,85570,747,000139,994,0002,113,536
7Oct 19, 2026 22:20570,381222,403,95170,866,000140,175,0002,113,536
8Oct 19, 2026 22:20571,764222,562,25770,801,000140,752,0002,113,536
9Oct 19, 2026 22:20572,767222,858,48170,851,000141,073,0002,113,536