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 10, 2026 12:17Victor MerckléVictor MerckléScore: 2,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 12:182,53914,665,8885,146,0001,203,0002,117,632stderr
2Sep 10, 2026 12:182,54314,818,1885,160,0001,198,0002,117,632stderr
3Sep 10, 2026 12:182,54514,725,2975,162,0001,202,0002,117,632stderr
4Sep 10, 2026 12:182,55214,534,4555,157,0001,225,0002,117,632stderr
5Sep 10, 2026 12:182,56214,815,3365,167,0001,239,0002,117,632stderr
6Sep 10, 2026 12:182,59914,915,4355,376,0001,122,0002,117,632stderr
7Sep 10, 2026 12:182,60314,855,1535,393,0001,115,0002,117,632stderr
8Sep 10, 2026 12:182,62014,942,0915,445,0001,107,0002,117,632stderr
9Sep 10, 2026 12:182,62214,930,8475,314,0001,243,0002,117,632stderr