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 6, 2026 10:54Victor MerckléVictor MerckléScore: 64,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 10:5564,29732,934,34922,661,0001,129,0002,113,536
2Jun 6, 2026 10:5564,31332,940,84522,728,0001,068,0002,113,536
3Jun 6, 2026 10:5564,31832,887,41622,668,0001,130,0002,113,536
4Jun 6, 2026 10:5564,37532,923,26722,669,0001,150,0002,113,536
5Jun 6, 2026 10:5564,47032,938,20622,715,0001,139,0002,113,536
6Jun 6, 2026 10:5564,52132,965,90222,730,0001,143,0002,113,536
7Jun 6, 2026 10:5564,86735,527,34322,857,0001,144,0002,113,536
8Jun 6, 2026 10:5564,89133,086,06922,869,0001,141,0002,113,536
9Jun 6, 2026 10:5564,95633,153,74222,864,0001,170,0002,113,536