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 listJan 28, 2026 01:10Josu San MartinJosu San MartinScore: 129,200Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2026 01:1267,33848,765,45522,922,0001,993,0002,396,160
2Jan 28, 2026 01:1067,37346,631,64023,931,000997,0002,277,376
3Jan 28, 2026 01:1267,42750,136,71923,951,000997,0002,277,376
4Jan 28, 2026 01:12129,18471,449,35946,803,000995,0002,277,376
5Jan 28, 2026 01:12129,18676,478,56846,804,000995,0002,277,376
6Jan 28, 2026 01:12129,19775,192,55245,812,0001,991,0002,396,160
7Jan 28, 2026 01:10129,20074,707,62147,804,00002,277,376
8Jan 28, 2026 01:12129,76575,996,30747,013,0001,000,0002,396,160
9Jan 28, 2026 01:12130,11976,988,50046,138,0002,006,0002,277,376
10Jan 28, 2026 01:12130,14977,558,01746,149,0002,006,0002,400,256
11Jan 28, 2026 01:10130,24972,080,90646,184,0002,008,0002,277,376
12Jan 28, 2026 01:12130,27371,537,24547,197,0001,004,0002,277,376