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 11, 2026 15:04Victor MerckléVictor MerckléScore: 71,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:0571,19435,825,95125,144,0001,198,0002,113,536
2May 11, 2026 15:0571,22435,141,95925,182,0001,171,0002,113,536
3May 11, 2026 15:0571,31336,934,48825,160,0001,226,0002,113,536
4May 11, 2026 15:0571,37535,104,13125,193,0001,216,0002,113,536
5May 11, 2026 15:0571,40836,375,36525,220,0001,201,0002,113,536
6May 11, 2026 15:0571,41037,049,54225,249,0001,173,0002,113,536
7May 11, 2026 15:0571,62438,358,47425,327,0001,174,0002,113,536
8May 11, 2026 15:0571,63235,255,58225,281,0001,223,0002,113,536
9May 11, 2026 15:0571,66235,971,85925,300,0001,215,0002,113,536