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 29, 2026 21:14IlyaIlyaScore: 59,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 21:1658,93231,244,99220,705,0001,100,0002,113,536
2Jun 29, 2026 21:1659,05932,678,10620,737,0001,115,0002,113,536
3Jun 29, 2026 21:1659,13231,378,02720,761,0001,118,0002,113,536
4Jun 29, 2026 21:1659,15631,357,29320,785,0001,103,0002,113,536
5Jun 29, 2026 21:1659,24531,391,60620,740,0001,181,0002,113,536
6Jun 29, 2026 21:1659,45931,964,58120,767,0001,233,0002,113,536
7Jun 29, 2026 21:1659,52732,033,29620,793,0001,232,0002,113,536
8Jun 29, 2026 21:1659,54831,992,50120,837,0001,196,0002,113,536
9Jun 29, 2026 21:1660,28639,609,50721,146,0001,160,0002,113,536