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 listJun 10, 2026 16:20Victor MerckléVictor MerckléScore: 63,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 16:2162,33730,486,32523,065,00002,113,536
2Jun 10, 2026 16:2162,47830,500,44723,117,00002,113,536
3Jun 10, 2026 16:2162,92130,591,32723,281,00002,113,536
4Jun 10, 2026 16:2163,11831,343,04723,354,00002,113,536
5Jun 10, 2026 16:2163,36230,851,24522,420,0001,024,0002,113,536
6Jun 10, 2026 16:2163,47030,816,87223,484,00002,113,536
7Jun 10, 2026 16:2163,51831,451,57123,502,00002,113,536
8Jun 10, 2026 16:2163,56430,909,78123,519,00002,113,536
9Jun 10, 2026 16:2164,30531,552,96522,782,0001,011,0002,113,536