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 26, 2026 21:08IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 21:09032,618,10822,180,0001,215,0002,113,536expected "429496515053 ", got "429496516631 "
2Jun 26, 2026 21:0963,07032,535,28322,239,0001,097,0002,113,536
3Jun 26, 2026 21:0963,18932,663,02222,180,0001,200,0002,113,536
4Jun 26, 2026 21:0963,30032,680,63422,245,0001,176,0002,113,536
5Jun 26, 2026 21:0963,35933,127,16822,228,0001,215,0002,113,536
6Jun 26, 2026 21:0963,44333,168,54322,246,0001,228,0002,113,536
7Jun 26, 2026 21:0963,61833,068,49722,325,0001,214,0002,113,536
8Jun 26, 2026 21:0963,72133,882,50122,367,0001,210,0002,113,536
9Jun 26, 2026 21:0963,97032,996,44622,618,0001,051,0002,113,536