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:24Andrew EpsteinAndrew EpsteinScore: 1,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:251,41312,189,8883,534,00002,117,632
2Sep 14, 2026 00:251,41512,017,2813,538,00002,117,632
3Sep 14, 2026 00:251,44512,109,0703,613,00002,117,632
4Sep 14, 2026 00:251,45012,164,4793,626,00002,117,632
5Sep 14, 2026 00:251,48112,348,0613,704,00002,117,632
6Sep 14, 2026 00:251,48312,962,9752,697,0001,011,0002,117,632
7Sep 14, 2026 00:251,48312,323,9392,699,0001,009,0002,117,632
8Sep 14, 2026 00:251,48312,154,3972,702,0001,006,0002,117,632
9Sep 14, 2026 00:251,48812,199,1882,706,0001,016,0002,117,632