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:49Andrew EpsteinAndrew EpsteinScore: 1,518Success
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:511,50912,453,8023,774,00002,117,632
2Sep 14, 2026 00:511,51312,483,6483,784,00002,117,632
3Sep 14, 2026 00:511,51412,535,8503,786,00002,117,632
4Sep 14, 2026 00:511,51512,465,9523,788,00002,117,632
5Sep 14, 2026 00:511,51812,497,9803,795,00002,117,632
6Sep 14, 2026 00:511,55012,813,8863,876,00002,117,632
7Sep 14, 2026 00:511,56412,557,0233,912,00002,117,632
8Sep 14, 2026 00:511,59613,330,1242,974,0001,017,0002,117,632
9Sep 14, 2026 00:511,60412,664,8132,988,0001,024,0002,117,632