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 9, 2026 22:23highload-churnerhighload-churnerScore: 56,472Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 23:4056,34329,822,88020,847,000020,480
2Oct 9, 2026 23:4056,34529,843,44720,848,000020,480
3Oct 9, 2026 23:4056,39729,811,40720,867,000020,480
4Oct 9, 2026 23:4056,44829,880,15520,886,000020,480
5Oct 9, 2026 23:4056,47229,879,10820,895,000020,480
6Oct 9, 2026 23:4056,50029,848,57420,905,000020,480
7Oct 9, 2026 23:4056,55629,861,79320,926,000020,480
8Oct 9, 2026 23:4056,57029,931,09220,931,000020,480
9Oct 9, 2026 23:4056,57229,954,40120,932,000020,480