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 23:48Victor MerckléVictor MerckléScore: 64,667Success
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 23:4964,45434,729,28722,835,0001,013,0002,113,536
2May 11, 2026 23:4964,52732,607,63222,789,0001,086,0002,113,536
3May 11, 2026 23:4964,53534,446,98022,789,0001,089,0002,113,536
4May 11, 2026 23:4964,55132,685,27422,800,0001,084,0002,113,536
5May 11, 2026 23:4964,66735,562,76022,837,0001,090,0002,113,536
6May 11, 2026 23:4964,75435,428,31522,849,0001,110,0002,113,536
7May 11, 2026 23:4964,78134,853,79422,957,0001,012,0002,113,536
8May 11, 2026 23:4964,80534,136,27022,967,0001,011,0002,113,536
9May 11, 2026 23:4965,52433,216,97723,179,0001,065,0002,113,536