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 12, 2026 13:40highload-churnerhighload-churnerScore: 73,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 13:4173,73536,216,45025,895,0001,387,00020,480
2Oct 12, 2026 13:4173,76236,143,78725,907,0001,385,00020,480
3Oct 12, 2026 13:4173,76738,271,42125,904,0001,390,00020,480
4Oct 12, 2026 13:4173,84336,252,76725,925,0001,397,00020,480
5Oct 12, 2026 13:4173,86436,190,02525,941,0001,389,00020,480
6Oct 12, 2026 13:4173,88936,268,99725,939,0001,400,00020,480
7Oct 12, 2026 13:4173,98336,275,78925,982,0001,392,00020,480
8Oct 12, 2026 13:4174,00836,281,02625,994,0001,389,00020,480
9Oct 12, 2026 13:4174,54539,509,42826,142,0001,440,00020,480