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 30, 2026 08:02IlyaIlyaScore: 61,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 08:0661,54332,247,57821,633,0001,138,0002,113,536
2Jun 30, 2026 08:0661,67233,591,49721,631,0001,188,0002,113,536
3Jun 30, 2026 08:0661,69732,443,42021,694,0001,134,0002,113,536
4Jun 30, 2026 08:0661,70832,326,79321,726,0001,106,0002,113,536
5Jun 30, 2026 08:0661,83732,793,82921,675,0001,205,0002,113,536
6Jun 30, 2026 08:0661,86432,475,64421,697,0001,193,0002,113,536
7Jun 30, 2026 08:0661,96232,862,31321,726,0001,200,0002,113,536
8Jun 30, 2026 08:0662,03232,900,21821,758,0001,194,0002,113,536
9Jun 30, 2026 08:0663,95444,321,24022,413,0001,250,0002,113,536