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 23:27IlyaIlyaScore: 21,412,470Success
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:3058,85432,058,72520,575,0001,201,0002,113,536
2Jul 8, 2026 23:3058,95632,068,15020,615,0001,199,0002,113,536
3Jul 8, 2026 23:3059,08632,122,45920,659,0001,203,0002,113,536
4Jul 8, 2026 23:3021,278,6087,882,995,8417,720,898,000152,187,0002,113,536
5Jul 8, 2026 23:3021,412,4707,933,146,6407,772,252,000150,362,0002,113,536
6Jul 8, 2026 23:3021,415,0167,933,755,1077,776,062,000147,494,0002,113,536
7Jul 8, 2026 23:3021,464,8437,951,875,8297,793,023,000148,969,0002,113,536
8Jul 8, 2026 23:3021,479,6357,957,709,7067,793,634,000153,831,0002,113,536
9Jul 8, 2026 23:3021,568,5087,990,287,0767,828,492,000151,856,0002,113,536