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 10, 2026 12:35Victor MerckléVictor MerckléScore: 63,151Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:3662,58630,728,20223,157,00002,117,632stderr
2Jun 10, 2026 12:3662,92730,853,85023,283,00002,117,632stderr
3Jun 10, 2026 12:3663,03530,674,61323,323,00002,117,632stderr
4Jun 10, 2026 12:3663,14530,922,15023,364,00002,117,632stderr
5Jun 10, 2026 12:3663,15130,955,37123,366,00002,117,632stderr
6Jun 10, 2026 12:3663,44531,107,24023,475,00002,117,632stderr
7Jun 10, 2026 12:3663,55430,893,06122,513,0001,002,0002,117,632stderr
8Jun 10, 2026 12:3663,56431,393,88323,519,00002,117,632stderr
9Jun 10, 2026 12:3663,99131,540,70322,666,0001,011,0002,117,632stderr