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 21:11Victor MerckléVictor MerckléScore: 64,789Success
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 21:1264,60532,664,16022,831,0001,073,0002,113,536
2May 11, 2026 21:1264,70833,477,24022,843,0001,099,0002,113,536
3May 11, 2026 21:1264,72138,495,86322,851,0001,096,0002,113,536
4May 11, 2026 21:1264,75934,593,11722,890,0001,071,0002,113,536
5May 11, 2026 21:1264,78934,445,44722,885,0001,087,0002,113,536
6May 11, 2026 21:1264,85435,417,19422,895,0001,101,0002,113,536
7May 11, 2026 21:1265,13233,475,61923,013,0001,086,0002,113,536
8May 11, 2026 21:1265,14334,719,28223,013,0001,090,0002,113,536
9May 11, 2026 21:1265,20032,852,26223,021,0001,103,0002,113,536