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 listJun 17, 2026 22:55Victor MerckléVictor MerckléScore: 63,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 22:5662,64830,678,26123,180,00002,113,536
2Jun 17, 2026 22:5663,10530,876,27223,349,00002,113,536
3Jun 17, 2026 22:5663,18330,838,88223,378,00002,113,536
4Jun 17, 2026 22:5663,24332,030,27323,400,00002,113,536
5Jun 17, 2026 22:5663,45630,958,66223,479,00002,113,536
6Jun 17, 2026 22:5663,46431,026,73323,482,00002,113,536
7Jun 17, 2026 22:5663,77231,121,41223,596,00002,113,536
8Jun 17, 2026 22:5663,93531,111,25323,656,00002,113,536
9Jun 17, 2026 22:5663,94031,197,47223,658,00002,113,536