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 18:44Victor MerckléVictor MerckléScore: 63,745Success
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 18:4563,40230,899,52323,459,00002,113,536
2Jun 10, 2026 18:4563,61030,934,00723,536,00002,113,536
3Jun 10, 2026 18:4563,67032,712,05523,558,00002,113,536
4Jun 10, 2026 18:4563,70530,992,21723,571,00002,113,536
5Jun 10, 2026 18:4563,74530,985,97623,586,00002,113,536
6Jun 10, 2026 18:4563,87031,099,09422,594,0001,038,0002,113,536
7Jun 10, 2026 18:4563,90531,065,64423,645,00002,113,536
8Jun 10, 2026 18:4563,96231,104,46723,666,00002,113,536
9Jun 10, 2026 18:4564,05631,103,27123,701,00002,113,536