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 10, 2026 21:58IlyaIlyaScore: 91,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 22:0090,41843,190,41932,249,0001,206,0002,113,536
2Jul 10, 2026 22:0090,94343,367,95132,536,0001,113,0002,113,536
3Jul 10, 2026 22:0091,26743,575,18932,565,0001,204,0002,113,536
4Jul 10, 2026 22:0091,70845,462,14332,729,0001,203,0002,113,536
5Jul 10, 2026 22:0091,75443,640,52832,832,0001,117,0002,113,536
6Jul 10, 2026 22:0091,77043,689,08032,807,0001,148,0002,113,536
7Jul 10, 2026 22:0092,01344,405,73232,808,0001,237,0002,113,536
8Jul 10, 2026 22:0021,402,2837,928,678,2927,768,625,000150,220,0002,113,536
9Jul 10, 2026 22:0021,498,8277,965,396,9797,806,790,000147,776,0002,113,536