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 17, 2026 11:40M-RochatM-RochatScore: 62,732Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:4162,66433,372,99422,177,0001,009,0002,113,536
2May 17, 2026 11:4162,68632,048,17922,148,0001,046,0002,113,536
3May 17, 2026 11:4162,71334,541,39322,188,0001,016,0002,113,536
4May 17, 2026 11:4162,73232,016,08422,183,0001,028,0002,113,536
5May 17, 2026 11:4162,73233,905,30722,162,0001,049,0002,113,536
6May 17, 2026 11:4162,76434,203,84622,200,0001,023,0002,113,536
7May 17, 2026 11:4162,98333,389,35022,265,0001,039,0002,113,536
8May 17, 2026 11:4163,06432,132,75822,309,0001,025,0002,113,536
9May 17, 2026 11:4163,36733,901,32622,368,0001,078,0002,113,536