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:00Victor MerckléVictor MerckléScore: 63,183Success
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:0162,47530,834,73422,092,0001,024,0002,113,536
2Jun 10, 2026 16:0162,80830,676,21222,211,0001,028,0002,113,536
3Jun 10, 2026 16:0162,87534,657,65822,223,0001,041,0002,113,536
4Jun 10, 2026 16:0163,05430,751,37722,287,0001,043,0002,113,536
5Jun 10, 2026 16:0163,18330,753,05522,338,0001,040,0002,113,536
6Jun 10, 2026 16:0163,21830,770,65222,328,0001,063,0002,113,536
7Jun 10, 2026 16:0163,23730,802,11522,354,0001,044,0002,113,536
8Jun 10, 2026 16:0163,49730,926,88222,452,0001,042,0002,113,536
9Jun 10, 2026 16:0164,05631,080,53022,634,0001,067,0002,113,536