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:28IlyaIlyaError
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:33031,350,89320,531,0001,104,0002,113,536expected "429496563836 ", got "429496561229 "
2Jul 8, 2026 23:3358,37831,838,97820,479,0001,121,0002,113,536
3Jul 8, 2026 23:3358,40231,254,96520,468,0001,141,0002,113,536
4Jul 8, 2026 23:3358,65931,350,01320,559,0001,145,0002,113,536
5Jul 8, 2026 23:3358,92432,045,14920,598,0001,204,0002,113,536
6Jul 8, 2026 23:3321,276,2247,882,039,0247,722,076,000150,127,0002,113,536
7Jul 8, 2026 23:3321,392,0457,925,064,3667,762,617,000152,440,0002,113,536
8Jul 8, 2026 23:3321,483,9407,959,512,8567,799,766,000149,292,0002,113,536
9Jul 8, 2026 23:3321,548,0407,983,004,2157,822,711,000150,064,0002,113,536