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 12, 2026 04:13Victor MerckléVictor MerckléScore: 67,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 04:1566,72134,041,21523,647,0001,040,0002,138,112
2Jun 12, 2026 04:1566,95433,837,24323,733,0001,040,0002,138,112
3Jun 12, 2026 04:1567,23734,344,90123,838,0001,040,0002,138,112
4Jun 12, 2026 04:1567,25433,790,49123,842,0001,042,0002,138,112
5Jun 12, 2026 04:1567,27532,468,96523,852,0001,040,0002,138,112
6Jun 12, 2026 04:1567,42132,555,61023,814,0001,132,0002,138,112
7Jun 12, 2026 04:1567,62936,083,87123,983,0001,040,0002,138,112
8Jun 12, 2026 04:1567,94834,500,69824,100,0001,041,0002,138,112
9Jun 12, 2026 04:15167,40871,173,27760,923,0001,018,0002,138,112