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 3, 2026 21:22Aleksei ShahoikaAleksei ShahoikaScore: 71,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 21:2371,63742,528,91025,334,0001,172,0002,523,136
2May 3, 2026 21:2371,92146,482,68525,445,0001,166,0002,523,136
3May 3, 2026 21:2371,92142,521,00325,340,0001,271,0002,510,848
4May 3, 2026 21:2371,97244,673,33525,343,0001,287,0002,527,232
5May 3, 2026 21:2371,99442,414,65925,366,0001,272,0002,519,040
6May 3, 2026 21:2372,01645,972,99325,380,0001,266,0002,519,040
7May 3, 2026 21:2372,20544,184,99125,458,0001,258,0002,514,944
8May 3, 2026 21:2372,22143,288,35325,450,0001,272,0002,519,040
9May 3, 2026 21:2375,73760,521,31326,924,0001,099,0002,506,752