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 11, 2026 18:54highload-churnerhighload-churnerScore: 129,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2026 18:55128,51056,527,4777,218,00040,331,00020,480
2Oct 11, 2026 18:55129,08356,514,4737,243,00040,518,00020,480
3Oct 11, 2026 18:55129,56456,865,8747,116,00040,823,00020,480
4Oct 11, 2026 18:55129,77556,840,1327,132,00040,885,00020,480
5Oct 11, 2026 18:55129,80056,825,5507,130,00040,896,00020,480
6Oct 11, 2026 18:55130,15956,938,8447,156,00041,003,00020,480
7Oct 11, 2026 18:55130,45958,546,9197,173,00041,097,00020,480
8Oct 11, 2026 18:55131,08157,371,6777,199,00041,301,00020,480
9Oct 11, 2026 18:55131,32157,471,6157,205,00041,384,00020,480