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:50Victor MerckléVictor MerckléScore: 66,729Success
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:5366,54035,005,94123,429,0001,191,0002,113,536
2May 11, 2026 23:5366,56734,043,13023,425,0001,205,0002,113,536
3May 11, 2026 23:5366,66233,443,44623,478,0001,187,0002,113,536
4May 11, 2026 23:5366,66435,242,07323,455,0001,211,0002,113,536
5May 11, 2026 23:5366,72936,317,13123,476,0001,214,0002,113,536
6May 11, 2026 23:5366,78634,217,97123,521,0001,190,0002,113,536
7May 11, 2026 23:5367,04335,290,27523,577,0001,229,0002,113,536
8May 11, 2026 23:5367,06233,538,47223,601,0001,212,0002,113,536
9May 11, 2026 23:5367,29736,463,00123,700,0001,200,0002,113,536