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 listAug 31, 2026 09:54Victor MerckléVictor MerckléScore: 56,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 09:5856,06429,005,60420,744,00002,113,536
2Aug 31, 2026 09:5856,18630,648,89219,786,0001,003,0002,113,536
3Aug 31, 2026 09:5856,19129,938,94219,758,0001,033,0002,113,536
4Aug 31, 2026 09:5856,21029,141,97119,785,0001,013,0002,113,536
5Aug 31, 2026 09:5856,25429,023,65220,814,00002,113,536
6Aug 31, 2026 09:5856,34029,177,28919,841,0001,005,0002,113,536
7Aug 31, 2026 09:5856,38630,066,07319,853,0001,010,0002,113,536
8Aug 31, 2026 09:5856,41829,272,74619,864,0001,011,0002,113,536
9Aug 31, 2026 09:5856,45629,597,07019,877,0001,012,0002,113,536