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 17:15Victor MerckléVictor MerckléScore: 56,208Success
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 17:1556,11028,901,61519,723,0001,038,0002,113,536
2Aug 28, 2026 17:1556,11828,921,48820,764,00002,113,536
3Aug 28, 2026 17:1556,16229,009,60119,764,0001,016,0002,113,536
4Aug 28, 2026 17:1556,19729,887,89519,791,0001,002,0002,113,536
5Aug 28, 2026 17:1556,20828,947,46920,797,00002,113,536
6Aug 28, 2026 17:1556,25129,025,42519,776,0001,037,0002,113,536
7Aug 28, 2026 17:1556,28329,963,19719,812,0001,013,0002,113,536
8Aug 28, 2026 17:1556,31028,960,20319,798,0001,037,0002,113,536
9Aug 28, 2026 17:1557,12438,430,12620,114,0001,022,0002,113,536