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:26highload-churnerhighload-churnerScore: 107,367Success
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:27106,97549,917,22239,581,000020,480
2Oct 12, 2026 13:27106,99148,496,57739,587,000020,480
3Oct 12, 2026 13:27107,15448,465,43639,647,000020,480
4Oct 12, 2026 13:27107,30248,678,33939,702,000020,480
5Oct 12, 2026 13:27107,36748,519,91139,726,000020,480
6Oct 12, 2026 13:27107,39448,555,54539,736,000020,480
7Oct 12, 2026 13:27107,41648,608,66139,744,000020,480
8Oct 12, 2026 13:27107,58148,614,29339,805,000020,480
9Oct 12, 2026 13:27107,58948,646,98239,808,000020,480