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 13:34highload-churnerhighload-churnerScore: 59,200Success
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 13:4358,21830,656,50820,531,0001,010,00024,576
2Oct 9, 2026 13:4358,38930,552,06820,584,0001,020,00020,480
3Oct 9, 2026 13:4359,09430,810,62220,850,0001,015,00020,480
4Oct 9, 2026 13:4359,18330,950,13720,879,0001,019,00020,480
5Oct 9, 2026 13:4359,20030,669,60020,894,0001,010,00020,480
6Oct 9, 2026 13:4359,37030,889,50220,957,0001,010,00020,480
7Oct 9, 2026 13:4359,64531,010,92920,979,0001,090,00024,576
8Oct 9, 2026 13:4362,49443,235,66522,069,0001,054,00020,480
9Oct 9, 2026 13:4362,52442,492,76021,992,0001,142,00024,576