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 07:46Victor MerckléVictor MerckléScore: 2,481Success
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 07:472,42414,715,4883,717,0002,343,0002,146,304stderr
2Sep 10, 2026 07:472,43614,689,8063,895,0002,196,0002,146,304stderr
3Sep 10, 2026 07:472,44014,803,6343,907,0002,194,0002,146,304stderr
4Sep 10, 2026 07:472,47914,935,9023,690,0002,509,0002,142,208stderr
5Sep 10, 2026 07:472,48114,876,4103,913,0002,291,0002,146,304stderr
6Sep 10, 2026 07:472,49014,798,6143,973,0002,253,0002,146,304stderr
7Sep 10, 2026 07:472,50714,979,4504,019,0002,250,0002,146,304stderr
8Sep 10, 2026 07:472,55614,977,7833,784,0002,608,0002,146,304stderr
9Sep 10, 2026 07:472,56815,029,2824,044,0002,377,0002,146,304stderr