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 20, 2026 12:13Jacob McDanielJacob McDanielScore: 2,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 12:132,48115,558,8145,012,0001,192,0002,117,632
2May 20, 2026 12:132,49415,931,1835,037,0001,200,0002,117,632
3May 20, 2026 12:132,49816,057,4605,047,0001,198,0002,117,632
4May 20, 2026 12:132,50416,912,0435,064,0001,197,0002,117,632
5May 20, 2026 12:132,51616,753,7185,078,0001,214,0002,117,632
6May 20, 2026 12:132,55116,183,3125,137,0001,241,0002,117,632
7May 20, 2026 12:132,57429,172,6545,206,0001,230,0002,117,632
8May 20, 2026 12:132,58418,914,2555,207,0001,254,0002,117,632
9May 20, 2026 12:132,63417,693,9765,302,0001,283,0002,117,632