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 listApr 27, 2026 14:50Victor MerckléVictor MerckléScore: 3,190,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 14:513,189,2161,198,245,8701,178,010,0002,000,0002,322,432stderr
2Apr 27, 2026 14:513,189,9001,197,999,5711,178,265,0001,998,0002,506,752stderr
3Apr 27, 2026 14:513,190,3451,201,149,9181,177,430,0002,998,0002,338,816stderr
4Apr 27, 2026 14:513,190,5451,200,416,8111,177,504,0002,998,0002,322,432stderr
5Apr 27, 2026 14:513,190,5861,197,300,8691,178,518,0001,999,0002,514,944stderr
6Apr 27, 2026 14:513,190,6541,202,166,4301,178,543,0001,999,0002,347,008stderr
7Apr 27, 2026 14:513,191,3021,199,024,7341,179,783,000999,0002,322,432stderr
8Apr 27, 2026 14:513,193,1291,199,539,1821,180,458,0001,000,0002,514,944stderr
9Apr 27, 2026 14:513,195,9831,201,535,5091,179,516,0002,998,0002,514,944stderr