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 listJun 26, 2026 12:43Victor MerckléVictor MerckléScore: 21,981,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 12:4521,535,8377,976,665,6227,954,093,00014,167,0002,117,632stderr
2Jun 26, 2026 12:4521,554,2787,983,596,6447,960,879,00014,204,0002,117,632stderr
3Jun 26, 2026 12:4521,881,6218,104,382,3088,082,091,00014,109,0002,117,632stderr
4Jun 26, 2026 12:4521,977,6328,139,920,4448,118,202,00013,522,0002,117,632stderr
5Jun 26, 2026 12:4521,981,0918,140,858,5518,119,278,00013,726,0002,117,632stderr
6Jun 26, 2026 12:4521,993,3138,145,380,5038,123,914,00013,612,0002,117,632stderr
7Jun 26, 2026 12:4522,080,0028,177,422,9768,155,667,00013,934,0002,117,632stderr
8Jun 26, 2026 12:4522,103,1328,186,297,1168,164,711,00013,448,0002,117,632stderr
9Jun 26, 2026 12:4522,643,1758,385,887,8208,364,423,00013,552,0002,117,632stderr