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 listMay 11, 2026 14:05Victor MerckléVictor MerckléScore: 66,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 14:0666,37835,116,49023,551,0001,009,0002,113,536
2May 11, 2026 14:0666,59435,568,25123,536,0001,104,0002,113,536
3May 11, 2026 14:0666,61636,553,53923,575,0001,073,0002,113,536
4May 11, 2026 14:0666,64533,590,55923,545,0001,114,0002,113,536
5May 11, 2026 14:0666,65133,371,97523,558,0001,103,0002,113,536
6May 11, 2026 14:0666,82433,485,90223,622,0001,103,0002,113,536
7May 11, 2026 14:0667,11033,581,80623,742,0001,089,0002,113,536
8May 11, 2026 14:0667,26433,485,27523,799,0001,089,0002,113,536
9May 11, 2026 14:0667,28933,441,38523,782,0001,115,0002,113,536