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:02Victor MerckléVictor MerckléScore: 64,427Success
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:0364,16232,890,89122,674,0001,066,0002,113,536
2Jun 6, 2026 10:0364,33232,977,67622,726,0001,077,0002,113,536
3Jun 6, 2026 10:0364,33732,965,32822,673,0001,132,0002,113,536
4Jun 6, 2026 10:0364,36232,921,72422,676,0001,138,0002,113,536
5Jun 6, 2026 10:0364,42733,032,91722,761,0001,077,0002,113,536
6Jun 6, 2026 10:0364,54832,992,99622,719,0001,164,0002,113,536
7Jun 6, 2026 10:0364,65135,576,59222,865,0001,056,0002,113,536
8Jun 6, 2026 10:0364,68632,989,11922,869,0001,065,0002,113,536
9Jun 6, 2026 10:0364,91033,055,48522,862,0001,155,0002,113,536