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 8, 2026 11:33Victor MerckléVictor MerckléScore: 4,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:374,00919,383,6297,240,0002,784,0002,134,016stderr
2Jul 8, 2026 11:374,05519,537,9046,750,0003,389,0002,142,208stderr
3Jul 8, 2026 11:374,06019,587,5966,746,0003,404,0002,142,208stderr
4Jul 8, 2026 11:374,08119,669,7946,800,0003,403,0002,142,208stderr
5Jul 8, 2026 11:374,09419,583,8956,767,0003,468,0002,142,208stderr
6Jul 8, 2026 11:374,10819,720,6116,754,0003,516,0002,142,208stderr
7Jul 8, 2026 11:374,13219,770,0016,895,0003,437,0002,134,016stderr
8Jul 8, 2026 11:374,16819,856,2557,020,0003,401,0002,134,016stderr
9Jul 8, 2026 11:374,23420,000,6826,823,0003,764,0002,134,016stderr