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 12, 2026 00:19Victor MerckléVictor MerckléScore: 64,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 00:2064,29734,301,92022,765,0001,025,0002,113,536
2May 12, 2026 00:2064,48933,023,13422,769,0001,092,0002,113,536
3May 12, 2026 00:2064,49432,621,61222,778,0001,085,0002,113,536
4May 12, 2026 00:2064,59134,533,60322,818,0001,081,0002,113,536
5May 12, 2026 00:2064,63535,513,98022,828,0001,087,0002,113,536
6May 12, 2026 00:2064,76734,631,76922,867,0001,097,0002,113,536
7May 12, 2026 00:2064,77534,557,95022,957,0001,010,0002,113,536
8May 12, 2026 00:2065,03235,073,09122,967,0001,095,0002,113,536
9May 12, 2026 00:2065,10234,181,46422,982,0001,106,0002,113,536