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 17:05Victor MerckléVictor MerckléScore: 63,797Success
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 17:0663,01330,959,22022,300,0001,015,0002,113,536
2Jun 24, 2026 17:0663,28331,396,56922,388,0001,027,0002,113,536
3Jun 24, 2026 17:0663,67831,189,23822,535,0001,026,0002,113,536
4Jun 24, 2026 17:0663,78331,727,06522,595,0001,005,0002,113,536
5Jun 24, 2026 17:0663,79731,072,79222,600,0001,005,0002,113,536
6Jun 24, 2026 17:0663,85131,283,81622,585,0001,040,0002,113,536
7Jun 24, 2026 17:0664,00231,247,32022,665,0001,016,0002,113,536
8Jun 24, 2026 17:0664,14031,770,44622,705,0001,027,0002,113,536
9Jun 24, 2026 17:0664,51031,975,14622,845,0001,024,0002,113,536