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 listSep 14, 2026 00:19Andrew EpsteinAndrew EpsteinScore: 1,634Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 15, 2026 06:56Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:201,58812,500,5192,804,0001,168,0002,121,728stderr
2Sep 14, 2026 00:201,62512,604,9882,913,0001,150,0002,121,728stderr
3Sep 14, 2026 00:201,63213,953,4362,912,0001,168,0002,121,728stderr
4Sep 14, 2026 00:201,63212,980,8052,705,0001,375,0002,121,728stderr
5Sep 14, 2026 00:201,63413,423,8462,726,0001,360,0002,121,728stderr
6Sep 14, 2026 00:201,63412,847,0502,916,0001,169,0002,121,728stderr
7Sep 14, 2026 00:201,64012,540,2472,788,0001,312,0002,121,728stderr
8Sep 14, 2026 00:201,64812,946,0042,908,0001,213,0002,121,728stderr
9Sep 14, 2026 00:201,70612,783,2292,925,0001,341,0002,121,728stderr