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 19, 2026 00:32Victor MerckléVictor MerckléScore: 62,972Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 00:3362,40530,702,93223,090,00002,113,536
2Jun 19, 2026 00:3362,67030,607,09923,188,00002,113,536
3Jun 19, 2026 00:3362,76730,616,93423,224,00002,113,536
4Jun 19, 2026 00:3362,80530,693,02323,238,00002,113,536
5Jun 19, 2026 00:3362,97230,733,58723,300,00002,113,536
6Jun 19, 2026 00:3362,99730,746,00523,309,00002,113,536
7Jun 19, 2026 00:3363,00830,892,35423,313,00002,113,536
8Jun 19, 2026 00:3363,03730,905,84623,324,00002,113,536
9Jun 19, 2026 00:3363,10530,766,27623,349,00002,113,536