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 14:49Karthik ReddyKarthik ReddyScore: 54,035Success
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 15:2253,8626,028,954,06419,929,000020,480
2Oct 9, 2026 15:2253,9186,029,149,45819,950,000020,480
3Oct 9, 2026 15:2253,9596,028,877,57119,965,000020,480
4Oct 9, 2026 15:2254,0296,029,153,90419,991,000020,480
5Oct 9, 2026 15:2254,0356,029,002,64319,993,000020,480
6Oct 9, 2026 15:2254,0566,029,046,89920,001,000020,480
7Oct 9, 2026 15:2254,0566,029,090,88120,001,000020,480
8Oct 9, 2026 15:2254,0786,034,554,49120,009,000020,480
9Oct 9, 2026 15:2254,0866,029,082,69320,012,000020,480