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 19, 2026 14:17izotoffizotoffScore: 74,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 14:1974,51036,961,27325,491,0002,078,0002,142,208stderr
2Oct 19, 2026 14:1974,55436,978,02325,530,0002,055,0002,142,208stderr
3Oct 19, 2026 14:1974,56236,977,52825,508,0002,080,0002,142,208stderr
4Oct 19, 2026 14:1974,58336,956,06025,530,0002,066,0002,142,208stderr
5Oct 19, 2026 14:1974,80837,070,28225,621,0002,058,0002,142,208stderr
6Oct 19, 2026 14:1975,45937,298,92225,656,0002,264,0002,142,208stderr
7Oct 19, 2026 14:1975,92137,526,08625,908,0002,183,0002,142,208stderr
8Oct 19, 2026 14:1976,21037,587,66626,068,0002,130,0002,142,208stderr
9Oct 19, 2026 14:1976,28137,595,02326,073,0002,151,0002,142,208stderr