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 15, 2026 19:43Josu San MartinJosu San MartinScore: 2,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 19:432,74015,546,7755,747,0001,104,0002,117,632
2Sep 15, 2026 19:432,74615,522,0305,760,0001,105,0002,117,632
3Sep 15, 2026 19:432,74615,498,8155,760,0001,107,0002,117,632
4Sep 15, 2026 19:432,75115,543,7235,768,0001,110,0002,117,632
5Sep 15, 2026 19:432,75215,416,6515,773,0001,107,0002,117,632
6Sep 15, 2026 19:432,75415,523,4565,780,0001,106,0002,117,632
7Sep 15, 2026 19:432,79415,624,4125,873,0001,112,0002,117,632
8Sep 15, 2026 19:432,82415,648,8845,938,0001,123,0002,117,632
9Sep 15, 2026 19:432,82815,947,0345,944,0001,127,0002,117,632