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 11, 2026 10:14Victor MerckléVictor MerckléScore: 88,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 10:1586,89739,681,95925,155,0006,997,0002,113,536
2Jun 11, 2026 10:1587,20239,793,26825,160,0007,105,0002,113,536
3Jun 11, 2026 10:1587,94039,956,10125,458,0007,080,0002,113,536
4Jun 11, 2026 10:1588,15441,230,92825,562,0007,055,0002,113,536
5Jun 11, 2026 10:1588,35440,182,86925,336,0007,355,0002,113,536
6Jun 11, 2026 10:1588,54340,195,72625,207,0007,554,0002,113,536
7Jun 11, 2026 10:1589,40540,585,06225,285,0007,795,0002,113,536
8Jun 11, 2026 10:1589,72440,773,41025,931,0007,267,0002,113,536
9Jun 11, 2026 10:1590,32940,893,16926,297,0007,125,0002,113,536