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 16:35Victor MerckléVictor MerckléScore: 64,551Success
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 16:3663,80230,984,86723,607,00002,113,536
2Jun 10, 2026 16:3664,13731,074,94423,731,00002,113,536
3Jun 10, 2026 16:3664,23231,182,27023,766,00002,113,536
4Jun 10, 2026 16:3664,38331,745,28023,822,00002,113,536
5Jun 10, 2026 16:3664,55131,367,51323,884,00002,113,536
6Jun 10, 2026 16:3664,56231,264,93023,888,00002,113,536
7Jun 10, 2026 16:3664,94531,634,11824,030,00002,113,536
8Jun 10, 2026 16:3665,01831,691,55224,057,00002,113,536
9Jun 10, 2026 16:3665,41331,621,76423,157,0001,046,0002,113,536