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 19, 2026 22:58e1011e1011Score: 143,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 22:59129,68358,828,63746,878,0001,105,0002,113,536
2Oct 19, 2026 22:59129,95459,048,21046,896,0001,187,0002,113,536
3Oct 19, 2026 22:59130,60859,225,81347,200,0001,125,0002,113,536
4Oct 19, 2026 22:59143,03264,376,59251,709,0001,213,0002,113,536
5Oct 19, 2026 22:59143,13263,837,57051,848,0001,111,0002,113,536
6Oct 19, 2026 22:59143,22763,859,40651,882,0001,112,0002,113,536
7Oct 19, 2026 22:59143,50264,582,44251,895,0001,201,0002,113,536
8Oct 19, 2026 22:59143,58964,100,70451,988,0001,140,0002,113,536
9Oct 19, 2026 22:59143,69764,081,37351,969,0001,199,0002,113,536