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 listAug 2, 2026 06:43Victor MerckléVictor MerckléScore: 56,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 06:4456,61329,371,02019,924,0001,023,0002,113,536
2Aug 2, 2026 06:4456,69129,157,79319,971,0001,005,0002,113,536
3Aug 2, 2026 06:4456,76229,942,94419,961,0001,041,0002,113,536
4Aug 2, 2026 06:4456,77229,221,74419,996,0001,010,0002,113,536
5Aug 2, 2026 06:4456,82429,479,33320,017,0001,008,0002,113,536
6Aug 2, 2026 06:4456,84329,435,69320,031,0001,001,0002,113,536
7Aug 2, 2026 06:4456,89729,227,00820,041,0001,011,0002,113,536
8Aug 2, 2026 06:4456,90230,156,75120,031,0001,023,0002,113,536
9Aug 2, 2026 06:4457,07829,552,94120,095,0001,024,0002,113,536