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 10, 2026 15:50Victor MerckléVictor MerckléScore: 62,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:5162,32430,437,31623,060,00002,113,536
2Jun 10, 2026 15:5162,40830,482,50223,091,00002,113,536
3Jun 10, 2026 15:5162,65130,619,69923,181,00002,113,536
4Jun 10, 2026 15:5162,68330,593,88923,193,00002,113,536
5Jun 10, 2026 15:5162,85630,628,35623,257,00002,113,536
6Jun 10, 2026 15:5162,88930,686,30523,269,00002,113,536
7Jun 10, 2026 15:5163,27530,865,05823,412,00002,113,536
8Jun 10, 2026 15:5163,29130,803,81523,418,00002,113,536
9Jun 10, 2026 15:5163,32431,177,53223,430,00002,113,536