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 10, 2026 16:30Victor MerckléVictor MerckléScore: 63,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:3162,82930,620,70122,205,0001,042,0002,113,536
2Jun 10, 2026 16:3163,30231,467,03822,373,0001,049,0002,113,536
3Jun 10, 2026 16:3163,43231,180,75822,416,0001,054,0002,113,536
4Jun 10, 2026 16:3163,44530,889,92922,430,0001,045,0002,113,536
5Jun 10, 2026 16:3163,59131,221,93022,461,0001,068,0002,113,536
6Jun 10, 2026 16:3163,68931,368,23022,511,0001,054,0002,113,536
7Jun 10, 2026 16:3163,90531,421,12422,583,0001,062,0002,113,536
8Jun 10, 2026 16:3163,97031,064,14222,602,0001,067,0002,113,536
9Jun 10, 2026 16:3164,21031,145,92522,703,0001,055,0002,113,536