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 13:17IlyaIlyaScore: 63,870Success
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 13:1963,64333,057,98522,421,0001,127,0002,113,536
2Jun 29, 2026 13:1963,67833,097,84722,381,0001,180,0002,113,536
3Jun 29, 2026 13:1963,74333,394,27422,383,0001,202,0002,113,536
4Jun 29, 2026 13:1963,80233,534,00522,388,0001,219,0002,113,536
5Jun 29, 2026 13:1963,87033,587,01822,424,0001,208,0002,113,536
6Jun 29, 2026 13:1963,90533,638,42922,422,0001,223,0002,113,536
7Jun 29, 2026 13:1964,07533,277,16522,492,0001,216,0002,113,536
8Jun 29, 2026 13:1964,21333,738,51422,523,0001,236,0002,113,536
9Jun 29, 2026 13:1964,22933,724,22522,547,0001,218,0002,113,536