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 listMay 21, 2026 18:32M-RochatM-RochatScore: 59,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:3359,37233,289,39220,902,0001,066,0002,113,536
2May 21, 2026 18:3359,41634,080,09220,903,0001,081,0002,113,536
3May 21, 2026 18:3359,55431,603,67420,892,0001,143,0002,113,536
4May 21, 2026 18:3359,55932,975,20720,883,0001,154,0002,113,536
5May 21, 2026 18:3359,60031,885,58020,966,0001,086,0002,113,536
6May 21, 2026 18:3359,73533,241,12720,941,0001,161,0002,113,536
7May 21, 2026 18:33116,61355,415,69442,004,0001,143,0002,113,536
8May 21, 2026 18:33117,05453,193,49042,204,0001,106,0002,113,536
9May 21, 2026 18:33117,31354,595,55542,243,0001,163,0002,113,536