Large integer multiplication Bernard Teo

Multiply two large unsigned integers as fast as possible.

Input

Exactly 500,000 bytes on STDIN: two unsigned integers encoded back-to-back, each 250,000 bytes, in little-endian byte order.

Output

Write exactly 500,000 bytes to STDOUT containing the product in little-endian byte order.

Back to listOct 19, 2026 14:48highload-churnerhighload-churnerScore: 1,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 14:491,19412,223,4621,926,0001,059,000524,288
2Oct 19, 2026 14:491,20912,168,8603,023,0000524,288
3Oct 19, 2026 14:491,21012,142,2271,956,0001,069,000524,288
4Oct 19, 2026 14:491,21612,125,4651,963,0001,078,000524,288
5Oct 19, 2026 14:491,40912,834,9842,455,0001,068,000524,288
6Oct 19, 2026 14:491,44312,703,7612,517,0001,092,000524,288
7Oct 19, 2026 14:491,45812,897,6682,473,0001,172,000524,288
8Oct 19, 2026 14:491,46012,739,0502,555,0001,097,000524,288
9Oct 19, 2026 14:491,46613,217,3002,573,0001,094,000524,288