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 06:12Victor MerckléVictor MerckléScore: 57,091Success
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 06:1356,93228,685,42021,065,00002,113,536
2Jun 25, 2026 06:1356,96228,550,26820,042,0001,034,0002,113,536
3Jun 25, 2026 06:1356,97028,576,27320,056,0001,023,0002,113,536
4Jun 25, 2026 06:1357,00828,700,53620,089,0001,004,0002,113,536
5Jun 25, 2026 06:1357,09128,573,07420,087,0001,037,0002,113,536
6Jun 25, 2026 06:1357,11328,669,26820,102,0001,030,0002,113,536
7Jun 25, 2026 06:1357,14528,614,84520,127,0001,017,0002,113,536
8Jun 25, 2026 06:1357,17028,617,23920,123,0001,030,0002,113,536
9Jun 25, 2026 06:1357,17528,869,21920,143,0001,012,0002,113,536