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 12:43highload-churnerhighload-churnerScore: 1,530Success
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 12:431,48613,018,2952,607,0001,108,000524,288
2Oct 19, 2026 12:431,48712,948,7542,611,0001,108,000524,288
3Oct 19, 2026 12:431,51513,062,2272,686,0001,102,000524,288
4Oct 19, 2026 12:431,51613,027,7092,686,0001,105,000524,288
5Oct 19, 2026 12:431,53013,015,9132,722,0001,103,000524,288
6Oct 19, 2026 12:431,53513,163,3832,698,0001,141,000524,288
7Oct 19, 2026 12:431,57713,646,9512,862,0001,081,000524,288
8Oct 19, 2026 12:431,62213,281,6542,955,0001,101,000524,288
9Oct 19, 2026 12:431,64113,340,4152,989,0001,114,000524,288