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 listMay 17, 2026 18:06Jacob McDanielJacob McDanielScore: 3,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 18:073,55219,931,0557,682,0001,199,0002,117,632
2May 17, 2026 18:073,57219,008,8017,744,0001,188,0002,113,536
3May 17, 2026 18:073,57618,954,7887,758,0001,184,0002,117,632
4May 17, 2026 18:073,57719,932,4077,757,0001,186,0002,117,632
5May 17, 2026 18:073,58019,769,5487,766,0001,185,0002,117,632
6May 17, 2026 18:073,60521,026,4887,760,0001,254,0002,113,536
7May 17, 2026 18:073,62019,383,9867,803,0001,249,0002,117,632
8May 17, 2026 18:073,62420,395,5007,783,0001,278,0002,117,632
9May 17, 2026 18:073,68221,197,7377,916,0001,289,0002,117,632