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 listJul 7, 2026 17:32Victor MerckléVictor MerckléScore: 2,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 17:342,46116,119,1963,943,0002,210,0002,146,304stderr
2Jul 7, 2026 17:342,46416,327,5813,878,0002,282,0002,146,304stderr
3Jul 7, 2026 17:342,48616,339,8273,702,0002,513,0002,146,304stderr
4Jul 7, 2026 17:342,51316,286,1513,765,0002,518,0002,146,304stderr
5Jul 7, 2026 17:342,51416,302,8943,753,0002,532,0002,146,304stderr
6Jul 7, 2026 17:342,51516,293,4573,718,0002,571,0002,146,304stderr
7Jul 7, 2026 17:342,51816,676,0233,749,0002,547,0002,146,304stderr
8Jul 7, 2026 17:342,53914,458,6143,803,0002,546,0002,146,304stderr
9Jul 7, 2026 17:342,54616,651,1133,804,0002,561,0002,146,304stderr