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 7, 2026 18:54Victor MerckléVictor MerckléScore: 56,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 18:5556,61028,970,52120,946,00002,113,536
2Jul 7, 2026 18:5556,68634,771,17620,974,00002,113,536
3Jul 7, 2026 18:5556,71828,795,05119,961,0001,025,0002,113,536
4Jul 7, 2026 18:5556,74328,832,21420,995,00002,113,536
5Jul 7, 2026 18:5556,74328,822,02019,965,0001,030,0002,113,536
6Jul 7, 2026 18:5556,74828,857,27120,997,00002,113,536
7Jul 7, 2026 18:5556,77829,063,74021,008,00002,113,536
8Jul 7, 2026 18:5556,81628,794,82321,022,00002,113,536
9Jul 7, 2026 18:5556,87529,137,72321,044,00002,113,536