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 20:49Victor MerckléVictor MerckléScore: 64,891Success
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 20:5064,64832,618,73322,843,0001,077,0002,113,536
2May 11, 2026 20:5064,65133,642,39522,837,0001,084,0002,113,536
3May 11, 2026 20:5064,74033,659,13522,849,0001,105,0002,113,536
4May 11, 2026 20:5064,87235,590,89122,907,0001,096,0002,113,536
5May 11, 2026 20:5064,89133,867,71022,911,0001,099,0002,113,536
6May 11, 2026 20:5064,93735,409,69722,926,0001,101,0002,113,536
7May 11, 2026 20:5064,94834,530,43323,020,0001,011,0002,113,536
8May 11, 2026 20:5065,18932,823,45623,023,0001,097,0002,113,536
9May 11, 2026 20:5065,21834,600,98023,016,0001,115,0002,113,536