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 11:02Victor MerckléVictor MerckléScore: 64,194Success
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 11:0363,88931,286,55522,528,0001,111,0002,117,632stderr
2Jun 24, 2026 11:0364,04831,700,36922,596,0001,102,0002,117,632stderr
3Jun 24, 2026 11:0364,11631,713,51422,613,0001,110,0002,117,632stderr
4Jun 24, 2026 11:0364,18931,762,67222,690,0001,060,0002,117,632stderr
5Jun 24, 2026 11:0364,19431,374,00422,646,0001,106,0002,117,632stderr
6Jun 24, 2026 11:0364,19731,394,12122,635,0001,118,0002,117,632stderr
7Jun 24, 2026 11:0364,24031,788,37222,663,0001,106,0002,117,632stderr
8Jun 24, 2026 11:0364,39431,429,86422,730,0001,096,0002,117,632stderr
9Jun 24, 2026 11:0364,49131,826,26022,768,0001,094,0002,117,632stderr