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 20, 2026 08:50e1011e1011Score: 158,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 08:53156,06468,580,91856,545,0001,199,0002,113,536
2Oct 20, 2026 08:53156,49468,764,87056,711,0001,192,0002,113,536
3Oct 20, 2026 08:53156,50268,765,06256,721,0001,185,0002,113,536
4Oct 20, 2026 08:53156,61369,342,32156,685,0001,262,0002,113,536
5Oct 20, 2026 08:53158,24369,525,67757,533,0001,017,0002,113,536
6Oct 20, 2026 08:53173,15175,449,86962,791,0001,275,0002,113,536
7Oct 20, 2026 08:53173,42175,656,61563,154,0001,012,0002,113,536
8Oct 20, 2026 08:53173,48375,655,93662,926,0001,263,0002,113,536
9Oct 20, 2026 08:53173,64577,351,63663,228,0001,021,0002,113,536