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 21, 2026 19:36izotoffizotoffScore: 77,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:3676,68149,165,53727,359,0001,013,0002,342,912
2Mar 21, 2026 19:3676,75456,401,37926,371,0002,028,0002,293,760
3Mar 21, 2026 19:3676,77652,171,23227,393,0001,014,0002,543,616
4Mar 21, 2026 19:3677,02255,096,87227,481,0001,017,0002,543,616
5Mar 21, 2026 19:3677,10855,947,46728,530,00002,310,144
6Mar 21, 2026 19:3678,08160,309,03625,902,0002,988,0002,338,816
7Mar 21, 2026 19:3678,76552,903,69825,124,0004,019,0002,428,928
8Mar 21, 2026 19:3679,07660,061,36826,124,0003,134,0002,297,856
9Mar 21, 2026 19:3687,35758,922,15330,302,0002,020,0002,330,624