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 15, 2026 20:36M-RochatM-RochatScore: 109,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 20:36109,64349,251,43639,323,0001,245,0002,113,536
2May 15, 2026 20:36109,64849,356,66039,310,0001,260,0002,113,536
3May 15, 2026 20:36109,65949,210,17839,317,0001,257,0002,113,536
4May 15, 2026 20:36109,86249,821,18239,423,0001,226,0002,113,536
5May 15, 2026 20:36109,89449,405,57839,403,0001,258,0002,113,536
6May 15, 2026 20:36109,91849,297,10139,423,0001,247,0002,113,536
7May 15, 2026 20:36110,55152,755,41339,652,0001,252,0002,113,536
8May 15, 2026 20:36110,60550,155,85939,661,0001,263,0002,113,536
9May 15, 2026 20:36111,07550,047,16940,071,0001,027,0002,113,536