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 16, 2026 17:43M-RochatM-RochatScore: 68,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 17:4468,65634,207,16024,368,0001,035,0002,113,536
2May 16, 2026 17:4468,70537,065,04724,396,0001,025,0002,113,536
3May 16, 2026 17:4468,75436,300,45624,386,0001,053,0002,113,536
4May 16, 2026 17:4468,80034,370,80324,435,0001,021,0002,113,536
5May 16, 2026 17:4468,81635,115,80724,428,0001,034,0002,113,536
6May 16, 2026 17:4468,81636,228,86124,443,0001,019,0002,113,536
7May 16, 2026 17:4469,03738,424,21524,524,0001,020,0002,113,536
8May 16, 2026 17:4469,15436,154,16824,546,0001,041,0002,113,536
9May 16, 2026 17:4469,16437,266,72224,548,0001,043,0002,113,536