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 24, 2026 10:33Victor MerckléVictor MerckléScore: 63,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 10:3462,88330,688,95323,267,00002,113,536
2Jun 24, 2026 10:3463,10030,781,12823,347,00002,113,536
3Jun 24, 2026 10:3463,11331,029,13023,352,00002,113,536
4Jun 24, 2026 10:3463,30230,867,71923,422,00002,113,536
5Jun 24, 2026 10:3463,43530,876,38823,471,00002,113,536
6Jun 24, 2026 10:3463,61631,042,32523,538,00002,113,536
7Jun 24, 2026 10:3463,79131,252,96223,603,00002,113,536
8Jun 24, 2026 10:3463,84031,200,44323,621,00002,113,536
9Jun 24, 2026 10:3464,01831,311,87023,687,00002,113,536