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 25, 2026 11:14Victor MerckléVictor MerckléScore: 56,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 11:1556,73228,643,76219,969,0001,022,0002,113,536
2Jun 25, 2026 11:1556,83228,456,13421,028,00002,113,536
3Jun 25, 2026 11:1556,87028,470,03519,995,0001,047,0002,113,536
4Jun 25, 2026 11:1556,89128,867,16720,048,0001,002,0002,113,536
5Jun 25, 2026 11:1556,89728,570,19920,007,0001,045,0002,113,536
6Jun 25, 2026 11:1556,95128,534,23320,065,0001,007,0002,113,536
7Jun 25, 2026 11:1556,96728,482,23521,078,00002,113,536
8Jun 25, 2026 11:1557,05128,632,46420,085,0001,024,0002,113,536
9Jun 25, 2026 11:1557,09128,614,86320,120,0001,004,0002,113,536