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 listJul 2, 2026 21:41Victor MerckléVictor MerckléScore: 56,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 21:4256,70529,163,78619,961,0001,020,0002,113,536
2Jul 2, 2026 21:4256,72928,686,74820,990,00002,113,536
3Jul 2, 2026 21:4256,74828,711,48220,997,00002,113,536
4Jul 2, 2026 21:4256,77528,723,73419,977,0001,030,0002,113,536
5Jul 2, 2026 21:4256,87028,814,63920,006,0001,036,0002,113,536
6Jul 2, 2026 21:4256,89728,823,80221,052,00002,113,536
7Jul 2, 2026 21:4256,94328,778,64920,035,0001,034,0002,113,536
8Jul 2, 2026 21:4256,98128,768,53220,047,0001,036,0002,113,536
9Jul 2, 2026 21:4257,01028,823,56320,086,0001,008,0002,113,536