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 listMar 30, 2026 03:54limanjun99limanjun99Score: 68,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 03:5467,75148,442,17024,066,0001,002,0002,281,472
2Mar 30, 2026 03:5467,94952,829,90323,130,0002,011,0002,408,448
3Mar 30, 2026 03:5467,98147,962,14223,141,0002,012,0002,396,160
4Mar 30, 2026 03:5468,11146,578,56223,185,0002,016,0002,510,848
5Mar 30, 2026 03:5468,17848,522,49524,217,0001,009,0002,281,472
6Mar 30, 2026 03:5468,30049,349,45324,261,0001,010,0002,396,160
7Mar 30, 2026 03:5468,30354,191,25324,262,0001,010,0002,281,472
8Mar 30, 2026 03:5468,48451,979,56825,339,00002,281,472
9Mar 30, 2026 03:5468,50541,902,76724,334,0001,013,0002,396,160