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 listJun 21, 2026 23:06A_ShamanA_ShamanScore: 74,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 23:0774,02736,525,74326,347,0001,043,0002,113,536
2Jun 21, 2026 23:0774,31637,010,43526,444,0001,053,0002,113,536
3Jun 21, 2026 23:0774,36237,201,48726,460,0001,054,0002,113,536
4Jun 21, 2026 23:0774,40236,715,19326,481,0001,048,0002,113,536
5Jun 21, 2026 23:0774,49441,444,97326,510,0001,053,0002,113,536
6Jun 21, 2026 23:0774,51037,267,86726,522,0001,047,0002,113,536
7Jun 21, 2026 23:0774,64536,822,49426,576,0001,043,0002,113,536
8Jun 21, 2026 23:0774,95136,951,99126,685,0001,047,0002,113,536
9Jun 21, 2026 23:0775,06237,431,93126,720,0001,053,0002,113,536