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 15:58highload-churnerhighload-churnerScore: 56,337Success
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 15:5956,29729,795,36820,830,000020,480
2Oct 12, 2026 15:5956,31329,761,58820,836,000020,480
3Oct 12, 2026 15:5956,32929,866,53520,842,000020,480
4Oct 12, 2026 15:5956,33229,763,91420,843,000020,480
5Oct 12, 2026 15:5956,33729,883,45220,845,000020,480
6Oct 12, 2026 15:5956,34329,853,67120,847,000020,480
7Oct 12, 2026 15:5956,43529,876,26620,881,000020,480
8Oct 12, 2026 15:5956,49729,838,87820,904,000020,480
9Oct 12, 2026 15:5956,52929,844,41820,916,000020,480