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 listMay 11, 2026 22:54Victor MerckléVictor MerckléScore: 64,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 22:5564,33233,416,44122,789,0001,014,0002,113,536
2May 11, 2026 22:5564,42934,344,17722,837,0001,002,0002,113,536
3May 11, 2026 22:5564,50532,659,15622,842,0001,025,0002,113,536
4May 11, 2026 22:5564,54035,380,45022,792,0001,088,0002,113,536
5May 11, 2026 22:5564,67234,543,47522,778,0001,151,0002,113,536
6May 11, 2026 22:5564,68934,860,09622,850,0001,085,0002,113,536
7May 11, 2026 22:5565,04332,893,19922,973,0001,093,0002,113,536
8May 11, 2026 22:5565,04834,458,58122,970,0001,098,0002,113,536
9May 11, 2026 22:5565,09433,549,56322,977,0001,108,0002,113,536