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 16:06Karthik ReddyKarthik ReddyScore: 53,989Success
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 16:3653,8406,029,055,35619,921,000020,480
2Oct 9, 2026 16:3653,8626,028,952,99619,929,000020,480
3Oct 9, 2026 16:3653,9106,029,006,98219,947,000020,480
4Oct 9, 2026 16:3653,9376,030,771,19219,957,000020,480
5Oct 9, 2026 16:3653,9896,029,150,49519,976,000020,480
6Oct 9, 2026 16:3654,0356,029,102,52619,993,000020,480
7Oct 9, 2026 16:3654,0566,029,193,04120,001,000020,480
8Oct 9, 2026 16:3654,1026,029,255,46920,018,000020,480
9Oct 9, 2026 16:3654,1516,029,049,92420,036,000020,480