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 20, 2026 20:08A_ShamanA_ShamanScore: 235,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 20:09233,96795,601,62342,435,00044,133,0002,113,536
2Jun 20, 2026 20:09234,26795,720,71942,456,00044,223,0002,113,536
3Jun 20, 2026 20:09234,80595,893,82842,473,00044,405,0002,113,536
4Jun 20, 2026 20:09234,83296,009,48942,458,00044,430,0002,113,536
5Jun 20, 2026 20:09235,63596,247,81042,492,00044,693,0002,113,536
6Jun 20, 2026 20:09235,73296,143,92042,348,00044,873,0002,113,536
7Jun 20, 2026 20:09235,89796,405,73342,480,00044,802,0002,113,536
8Jun 20, 2026 20:09236,97296,760,48442,481,00045,199,0002,113,536
9Jun 20, 2026 20:09237,64896,909,71942,487,00045,443,0002,113,536