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 14:54M-RochatM-RochatScore: 60,510Success
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 14:5760,30831,471,56921,263,0001,051,0002,113,536
2May 17, 2026 14:5760,37834,461,53221,271,0001,069,0002,113,536
3May 17, 2026 14:5760,44332,211,89521,294,0001,070,0002,113,536
4May 17, 2026 14:5760,50234,476,78421,297,0001,089,0002,113,536
5May 17, 2026 14:5760,51032,816,99821,312,0001,077,0002,113,536
6May 17, 2026 14:5760,60233,121,91921,327,0001,096,0002,113,536
7May 17, 2026 14:5760,62732,639,11821,325,0001,107,0002,113,536
8May 17, 2026 14:5760,72734,694,78821,369,0001,100,0002,113,536
9May 17, 2026 14:5761,19435,212,58521,624,0001,018,0002,113,536