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 22:58IlyaIlyaScore: 21,437,729Success
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 23:0258,40831,287,97620,504,0001,107,0002,113,536
2Jul 8, 2026 23:0258,99132,147,89420,580,0001,247,0002,113,536
3Jul 8, 2026 23:0259,06432,094,70420,818,0001,036,0002,113,536
4Jul 8, 2026 23:0221,328,0707,901,296,2117,739,693,000151,693,0002,113,536
5Jul 8, 2026 23:0221,437,7297,942,024,2967,780,316,000151,644,0002,113,536
6Jul 8, 2026 23:0221,452,8377,948,212,3637,788,654,000148,896,0002,113,536
7Jul 8, 2026 23:0221,486,6187,960,619,9557,799,933,000150,116,0002,113,536
8Jul 8, 2026 23:0221,494,9547,962,997,4527,804,044,000149,089,0002,113,536
9Jul 8, 2026 23:0221,604,2378,004,021,8917,847,128,000146,440,0002,113,536