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:17Victor MerckléVictor MerckléScore: 56,164Success
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:1856,02928,843,17220,731,00002,113,536
2Aug 28, 2026 16:1856,05629,153,20820,741,00002,113,536
3Aug 28, 2026 16:1856,06429,820,13519,712,0001,032,0002,113,536
4Aug 28, 2026 16:1856,10029,130,27619,726,0001,031,0002,113,536
5Aug 28, 2026 16:1856,16428,923,09320,781,00002,113,536
6Aug 28, 2026 16:1856,26229,131,14019,784,0001,033,0002,113,536
7Aug 28, 2026 16:1856,27229,145,94920,821,00002,113,536
8Aug 28, 2026 16:1856,36429,924,41819,850,0001,005,0002,113,536
9Aug 28, 2026 16:1856,39729,952,33719,855,0001,012,0002,113,536