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 15:18Victor MerckléVictor MerckléScore: 56,827Success
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 15:1956,57829,271,24120,934,00002,113,536
2Aug 28, 2026 15:1956,65629,091,75120,963,00002,113,536
3Aug 28, 2026 15:1956,71029,376,19820,983,00002,113,536
4Aug 28, 2026 15:1956,72729,306,82219,959,0001,030,0002,113,536
5Aug 28, 2026 15:1956,82729,402,66520,023,0001,003,0002,113,536
6Aug 28, 2026 15:1956,83529,988,70319,993,0001,036,0002,113,536
7Aug 28, 2026 15:1956,94529,409,99920,066,0001,004,0002,113,536
8Aug 28, 2026 15:1956,97830,187,50120,043,0001,039,0002,113,536
9Aug 28, 2026 15:1957,00030,218,65220,061,0001,029,0002,113,536