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 24, 2026 23:29Victor MerckléVictor MerckléScore: 74,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 23:3174,08136,923,19326,140,0001,270,0002,117,632stderr
2Jun 24, 2026 23:3174,24336,568,84126,219,0001,251,0002,117,632stderr
3Jun 24, 2026 23:3174,24536,551,06226,202,0001,269,0002,117,632stderr
4Jun 24, 2026 23:3174,33237,030,41826,217,0001,286,0002,117,632stderr
5Jun 24, 2026 23:3174,55636,782,49926,332,0001,254,0002,117,632stderr
6Jun 24, 2026 23:3174,58936,706,69626,309,0001,289,0002,117,632stderr
7Jun 24, 2026 23:3174,62436,672,73626,339,0001,272,0002,117,632stderr
8Jun 24, 2026 23:3174,69436,681,09426,383,0001,254,0002,117,632stderr
9Jun 24, 2026 23:3174,84836,745,05226,424,0001,270,0002,117,632stderr