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 17, 2026 20:05Andrew EpsteinAndrew EpsteinScore: 1,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 20:111,47012,421,7072,617,0001,059,0002,117,632
2Sep 17, 2026 20:111,51412,443,6802,728,0001,058,0002,117,632
3Sep 17, 2026 20:111,51712,382,2662,734,0001,060,0002,117,632
4Sep 17, 2026 20:111,51812,427,5012,732,0001,064,0002,117,632
5Sep 17, 2026 20:111,52912,419,5552,519,0001,305,0002,117,632
6Sep 17, 2026 20:111,53112,454,4692,757,0001,072,0002,117,632
7Sep 17, 2026 20:111,53212,454,4252,751,0001,080,0002,117,632
8Sep 17, 2026 20:111,60225,405,8532,797,0001,208,0002,121,728
9Sep 17, 2026 20:111,67012,810,2143,100,0001,075,0002,117,632