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 listJul 12, 2026 22:06IlyaIlyaScore: 58,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 22:0758,42131,310,92520,499,0001,117,0002,113,536
2Jul 12, 2026 22:0758,44031,316,94120,520,0001,103,0002,113,536
3Jul 12, 2026 22:0758,55431,372,55520,553,0001,112,0002,113,536
4Jul 12, 2026 22:0758,58331,633,18920,551,0001,125,0002,113,536
5Jul 12, 2026 22:0758,61031,340,30620,570,0001,116,0002,113,536
6Jul 12, 2026 22:0758,69431,963,90520,526,0001,191,0002,113,536
7Jul 12, 2026 22:0758,72931,402,59120,611,0001,119,0002,113,536
8Jul 12, 2026 22:0758,74531,407,38720,710,0001,026,0002,117,632
9Jul 12, 2026 22:0759,04331,817,23620,629,0001,217,0002,113,536