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 4, 2026 07:18Victor MerckléVictor MerckléScore: 1,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:261,42012,021,8842,502,0001,048,0002,117,632stderr
2Sep 4, 2026 07:261,42811,886,0882,502,0001,070,0002,117,632stderr
3Sep 4, 2026 07:261,44311,959,4452,527,0001,082,0002,117,632stderr
4Sep 4, 2026 07:261,46111,866,7312,561,0001,092,0002,117,632stderr
5Sep 4, 2026 07:261,47611,944,0132,589,0001,102,0002,117,632stderr
6Sep 4, 2026 07:261,48211,978,3072,591,0001,115,0002,117,632stderr
7Sep 4, 2026 07:261,53413,051,4642,709,0001,126,0002,117,632stderr
8Sep 4, 2026 07:261,55412,285,3082,755,0001,131,0002,117,632stderr
9Sep 4, 2026 07:261,56512,196,6262,761,0001,152,0002,117,632stderr