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 listMar 26, 2026 18:38Dominique GarmierDominique GarmierScore: 69,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 18:3868,93047,495,88924,484,0001,020,0002,408,448
2Mar 26, 2026 18:3868,99552,335,47124,507,0001,021,0002,392,064
3Mar 26, 2026 18:3869,04951,571,39024,527,0001,021,0002,281,472
4Mar 26, 2026 18:3869,17656,004,07824,572,0001,023,0002,281,472
5Mar 26, 2026 18:3869,25950,032,51925,626,00002,392,064
6Mar 26, 2026 18:3869,47355,122,89925,705,00002,281,472
7Mar 26, 2026 18:3869,85456,116,84224,852,000994,0002,281,472
8Mar 26, 2026 18:3869,86554,332,96423,862,0001,988,0002,396,160
9Mar 26, 2026 18:3869,95746,975,44123,893,0001,991,0002,396,160