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 28, 2026 16:11Victor MerckléVictor MerckléScore: 57,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 16:1256,89729,823,55520,029,0001,023,0002,113,536
2Aug 28, 2026 16:1256,95429,443,44321,073,00002,113,536
3Aug 28, 2026 16:1256,98630,249,91620,080,0001,005,0002,113,536
4Aug 28, 2026 16:1257,18929,484,90120,153,0001,007,0002,113,536
5Aug 28, 2026 16:1257,21030,177,72120,118,0001,050,0002,113,536
6Aug 28, 2026 16:1257,34838,584,87220,177,0001,042,0002,113,536
7Aug 28, 2026 16:1257,47238,604,90620,256,0001,009,0002,113,536
8Aug 28, 2026 16:1258,45938,434,85020,622,0001,008,0002,113,536
9Aug 28, 2026 16:1261,25641,004,82821,565,0001,100,0002,113,536