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:55Victor MerckléVictor MerckléScore: 56,840Success
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:5656,74028,765,75919,960,0001,034,0002,113,536
2Jul 2, 2026 21:5656,77528,717,92020,003,0001,004,0002,113,536
3Jul 2, 2026 21:5656,79129,377,30419,999,0001,014,0002,113,536
4Jul 2, 2026 21:5656,81828,682,46319,993,0001,030,0002,113,536
5Jul 2, 2026 21:5656,84028,760,86619,997,0001,034,0002,113,536
6Jul 2, 2026 21:5656,85428,775,96220,033,0001,003,0002,113,536
7Jul 2, 2026 21:5656,90029,333,65520,030,0001,023,0002,113,536
8Jul 2, 2026 21:5656,98129,022,86820,073,0001,010,0002,113,536
9Jul 2, 2026 21:5656,98628,769,57320,044,0001,041,0002,113,536