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 2, 2026 12:06IlyaIlyaScore: 60,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:0759,82931,626,80021,037,0001,100,0002,113,536
2Jul 2, 2026 12:0759,87231,966,02621,044,0001,109,0002,113,536
3Jul 2, 2026 12:0760,08331,737,29721,117,0001,114,0002,113,536
4Jul 2, 2026 12:0760,10231,673,97721,097,0001,141,0002,117,632
5Jul 2, 2026 12:0760,21833,099,99821,155,0001,126,0002,113,536
6Jul 2, 2026 12:0760,24831,817,48421,161,0001,131,0002,117,632
7Jul 2, 2026 12:0760,25932,256,22321,078,0001,218,0002,113,536
8Jul 2, 2026 12:0760,31332,301,38421,119,0001,197,0002,113,536
9Jul 2, 2026 12:0760,52932,393,68721,191,0001,205,0002,113,536