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 20:53Victor MerckléVictor MerckléScore: 64,764Success
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 20:5664,47235,090,21522,845,0001,010,0002,113,536
2May 11, 2026 20:5664,59433,258,32622,885,0001,015,0002,113,536
3May 11, 2026 20:5664,60232,825,74822,829,0001,074,0002,113,536
4May 11, 2026 20:5664,62734,907,61522,830,0001,082,0002,113,536
5May 11, 2026 20:5664,76433,285,97222,880,0001,083,0002,113,536
6May 11, 2026 20:5664,78932,731,96822,892,0001,080,0002,113,536
7May 11, 2026 20:5664,90035,078,44522,966,0001,047,0002,113,536
8May 11, 2026 20:5665,15933,263,75123,020,0001,089,0002,113,536
9May 11, 2026 20:5665,27234,210,89623,030,0001,121,0002,113,536