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 15:40Victor MerckléVictor MerckléScore: 68,486Success
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 15:4168,21836,678,32124,017,0001,224,0002,113,536
2May 11, 2026 15:4168,26234,010,22924,050,0001,207,0002,113,536
3May 11, 2026 15:4168,39434,604,92724,107,0001,199,0002,113,536
4May 11, 2026 15:4168,40234,064,80924,094,0001,215,0002,113,536
5May 11, 2026 15:4168,48634,104,31424,145,0001,195,0002,113,536
6May 11, 2026 15:4168,78334,172,34924,279,0001,171,0002,113,536
7May 11, 2026 15:4168,80536,681,37224,274,0001,184,0002,113,536
8May 11, 2026 15:4168,87234,192,48324,293,0001,190,0002,113,536
9May 11, 2026 15:41188,45478,517,85468,569,0001,159,0002,113,536