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 23, 2026 20:27Victor MerckléVictor MerckléScore: 63,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 20:2863,12730,969,92623,357,00002,113,536
2Jun 23, 2026 20:2863,27231,383,57623,411,00002,113,536
3Jun 23, 2026 20:2863,34531,071,92222,432,0001,006,0002,113,536
4Jun 23, 2026 20:2863,36231,119,38423,444,00002,113,536
5Jun 23, 2026 20:2863,36731,453,89023,446,00002,113,536
6Jun 23, 2026 20:2863,44831,088,93223,476,00002,113,536
7Jun 23, 2026 20:2863,58931,485,92023,528,00002,113,536
8Jun 23, 2026 20:2863,86431,764,39823,630,00002,113,536
9Jun 23, 2026 20:2863,93531,282,32723,656,00002,113,536