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 listJun 2, 2026 07:16Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 02:54Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 04:22013,954,9444,184,0001,249,0002,113,536pos 249742: expected 83 got 84
2Jun 2, 2026 07:182,15613,055,7784,152,0001,240,0002,113,536
3Jun 2, 2026 07:182,16013,023,6904,157,0001,245,0002,113,536
4Jun 2, 2026 07:182,16213,052,8914,161,0001,246,0002,113,536
5Jun 2, 2026 07:182,16413,062,4654,169,0001,243,0002,113,536
6Jun 2, 2026 07:182,16613,054,4394,172,0001,244,0002,113,536
7Jun 2, 2026 07:182,16614,642,8804,154,0001,263,0002,113,536
8Jun 2, 2026 07:182,17313,062,2354,185,0001,248,0002,113,536
9Sep 5, 2026 04:222,22914,178,5574,294,0001,280,0002,113,536
10Jun 2, 2026 07:182,23713,243,9424,351,0001,243,0002,113,536
11Sep 5, 2026 04:222,25114,126,5984,383,0001,246,0002,113,536
12Jun 2, 2026 07:182,26413,291,5144,407,0001,253,0002,113,536