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 listMar 19, 2026 14:33limanjun99limanjun99Score: 21,501,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 14:3321,345,9357,933,087,8177,701,171,000196,825,0002,301,952
2Mar 19, 2026 14:3321,383,2247,940,750,6217,712,949,000198,844,0002,306,048
3Mar 19, 2026 14:3321,479,4197,984,772,6767,747,552,000199,833,0002,297,856
4Mar 19, 2026 14:3321,480,2087,976,508,0237,744,839,000202,838,0002,277,376
5Mar 19, 2026 14:3321,501,5707,986,012,9227,757,741,000197,840,0002,297,856
6Mar 19, 2026 14:3321,514,7087,992,521,9327,756,610,000203,832,0002,297,856
7Mar 19, 2026 14:3321,521,6057,992,963,8267,770,164,000192,830,0002,277,376
8Mar 19, 2026 14:3321,533,5228,006,179,3307,759,576,000207,827,0002,424,832
9Mar 19, 2026 14:3321,569,2438,005,533,9567,796,767,000183,853,0002,277,376