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 13:06IlyaIlyaScore: 59,727Success
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 13:0759,48331,612,65420,817,0001,192,0002,113,536
2Jul 7, 2026 13:0759,49733,755,52020,800,0001,214,0002,113,536
3Jul 7, 2026 13:0759,50531,561,11320,990,0001,027,0002,113,536
4Jul 7, 2026 13:0759,62731,731,95320,825,0001,237,0002,113,536
5Jul 7, 2026 13:0759,72732,249,62520,884,0001,215,0002,113,536
6Jul 7, 2026 13:0759,73732,301,00120,903,0001,200,0002,113,536
7Jul 7, 2026 13:0759,76731,733,92920,875,0001,239,0002,113,536
8Jul 7, 2026 13:0759,77832,866,51320,895,0001,223,0002,113,536
9Jul 7, 2026 13:0759,97232,259,86220,949,0001,241,0002,113,536