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 8, 2026 10:24IlyaIlyaScore: 59,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 10:2559,06731,548,69720,737,0001,118,0002,113,536
2Jul 8, 2026 10:2559,11331,547,13120,764,0001,108,0002,113,536
3Jul 8, 2026 10:2559,18331,581,79420,699,0001,199,0002,113,536
4Jul 8, 2026 10:2559,26232,186,54620,733,0001,194,0002,113,536
5Jul 8, 2026 10:2559,38332,300,04720,721,0001,251,0002,113,536
6Jul 8, 2026 10:2559,40031,660,88320,798,0001,180,0002,113,536
7Jul 8, 2026 10:2559,50232,324,81620,791,0001,225,0002,113,536
8Jul 8, 2026 10:2559,56432,337,40820,809,0001,230,0002,113,536
9Jul 8, 2026 10:2559,61332,418,01520,835,0001,222,0002,113,536