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 17:33Karthik ReddyKarthik ReddyScore: 53,991Success
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 17:5153,8836,028,917,84919,937,000020,480
2Oct 9, 2026 17:5153,9246,029,005,31219,952,000020,480
3Oct 9, 2026 17:5153,9706,029,126,37519,969,000020,480
4Oct 9, 2026 17:5153,9816,029,068,10219,973,000020,480
5Oct 9, 2026 17:5153,9916,028,954,92519,977,000020,480
6Oct 9, 2026 17:5154,0216,029,108,62519,988,000020,480
7Oct 9, 2026 17:5154,0566,029,011,84620,001,000020,480
8Oct 9, 2026 17:5154,0726,029,025,42920,007,000020,480
9Oct 9, 2026 17:5154,2376,029,444,33620,068,000020,480