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:47Victor MerckléVictor MerckléScore: 57,397Success
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:4757,07529,287,10821,118,00002,113,536
2Aug 28, 2026 16:4757,22930,214,40720,141,0001,034,0002,113,536
3Aug 28, 2026 16:4757,28329,388,62220,151,0001,044,0002,113,536
4Aug 28, 2026 16:4757,28329,570,32820,165,0001,030,0002,113,536
5Aug 28, 2026 16:4757,39730,373,61920,220,0001,017,0002,113,536
6Aug 28, 2026 16:4757,45130,227,97820,226,0001,031,0002,113,536
7Aug 28, 2026 16:4757,45629,625,64120,254,0001,005,0002,113,536
8Aug 28, 2026 16:4757,54829,444,95620,272,0001,021,0002,113,536
9Aug 28, 2026 16:47144,78962,629,37952,566,0001,006,0002,113,536