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 07:47Victor MerckléVictor MerckléScore: 1,400Success
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 07:481,33812,234,4372,275,0001,070,0002,117,632stderr
2Sep 15, 2026 07:481,37912,210,1571,887,0001,561,0002,117,632stderr
3Sep 15, 2026 07:481,38212,358,9061,901,0001,556,0002,117,632stderr
4Sep 15, 2026 07:481,39012,239,5191,908,0001,567,0002,117,632stderr
5Sep 15, 2026 07:481,40012,266,7991,939,0001,563,0002,117,632stderr
6Sep 15, 2026 07:481,45412,476,8252,524,0001,111,0002,117,632stderr
7Sep 15, 2026 07:481,45612,319,4762,063,0001,577,0002,117,632stderr
8Sep 15, 2026 07:481,48612,422,4692,144,0001,572,0002,117,632stderr
9Sep 15, 2026 07:481,48812,467,9282,159,0001,562,0002,117,632stderr