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 listAug 23, 2026 03:31Andrew EpsteinAndrew EpsteinScore: 2,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 03:312,73616,748,1235,613,0001,228,0002,117,632
2Aug 23, 2026 03:312,73916,656,2015,627,0001,222,0002,117,632
3Aug 23, 2026 03:312,74416,786,2005,628,0001,234,0002,117,632
4Aug 23, 2026 03:312,74616,808,1155,627,0001,238,0002,117,632
5Aug 23, 2026 03:312,75017,043,9155,646,0001,229,0002,117,632
6Aug 23, 2026 03:312,75018,713,0675,642,0001,235,0002,117,632
7Aug 23, 2026 03:312,75816,823,0755,646,0001,249,0002,117,632
8Aug 23, 2026 03:312,76116,717,5655,653,0001,251,0002,117,632
9Aug 23, 2026 03:312,82017,192,8555,789,0001,262,0002,117,632