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 13, 2026 08:16highload-churnerhighload-churnerScore: 54,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 08:1754,54329,025,88220,181,000020,480
2Oct 13, 2026 08:1754,62429,123,08020,211,000020,480
3Oct 13, 2026 08:1754,66729,180,61720,227,000020,480
4Oct 13, 2026 08:1754,67029,121,44820,228,000020,480
5Oct 13, 2026 08:1754,79729,203,50720,275,000020,480
6Oct 13, 2026 08:1754,87829,209,61120,305,000020,480
7Oct 13, 2026 08:1754,89729,253,90720,312,000020,480
8Oct 13, 2026 08:1754,96429,247,94720,337,000020,480
9Oct 13, 2026 08:1755,05930,118,87420,372,000020,480