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 16:24IlyaIlyaScore: 58,978Success
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 16:2558,72731,211,76620,634,0001,095,0002,113,536
2Jul 2, 2026 16:2558,72931,215,54620,601,0001,129,0002,113,536
3Jul 2, 2026 16:2558,85931,241,94020,643,0001,135,0002,113,536
4Jul 2, 2026 16:2558,89431,279,50820,677,0001,114,0002,113,536
5Jul 2, 2026 16:2558,97831,416,34120,703,0001,119,0002,113,536
6Jul 2, 2026 16:2558,98631,399,57020,621,0001,204,0002,113,536
7Jul 2, 2026 16:2559,02731,318,13420,708,0001,132,0002,113,536
8Jul 2, 2026 16:2559,06231,374,42220,689,0001,164,0002,113,536
9Jul 2, 2026 16:2559,14031,412,56020,764,0001,118,0002,113,536