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:56Victor MerckléVictor MerckléScore: 64,754Success
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:5764,60833,773,56122,834,0001,071,0002,113,536
2May 11, 2026 20:5764,62132,700,65922,835,0001,075,0002,113,536
3May 11, 2026 20:5764,62934,395,86222,908,0001,005,0002,113,536
4May 11, 2026 20:5764,65632,600,86122,851,0001,072,0002,113,536
5May 11, 2026 20:5764,75435,651,49922,879,0001,080,0002,113,536
6May 11, 2026 20:5764,85633,890,51322,890,0001,107,0002,113,536
7May 11, 2026 20:5765,12934,668,21423,023,0001,075,0002,113,536
8May 11, 2026 20:5765,19433,418,84623,031,0001,091,0002,113,536
9May 11, 2026 20:5765,24332,867,87923,041,0001,099,0002,113,536