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:55highload-churnerhighload-churnerScore: 56,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:1456,38929,889,69220,864,000020,480
2Oct 10, 2026 00:1456,43529,920,29520,881,000020,480
3Oct 10, 2026 00:1456,47529,886,86520,896,000020,480
4Oct 10, 2026 00:1456,52729,933,08120,915,000020,480
5Oct 10, 2026 00:1456,52729,862,84520,915,000020,480
6Oct 10, 2026 00:1456,58130,037,62520,935,000020,480
7Oct 10, 2026 00:1456,61329,989,46720,947,000020,480
8Oct 10, 2026 00:1456,65129,965,28420,961,000020,480
9Oct 10, 2026 00:1458,15140,784,00621,516,000020,480