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 18:19Victor MerckléVictor MerckléScore: 3,294Success
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 18:223,21717,431,6474,726,0003,317,0002,195,456stderr
2Jul 7, 2026 18:223,23817,383,3495,828,0002,269,0002,142,208stderr
3Jul 7, 2026 18:223,23817,426,8835,861,0002,235,0002,138,112stderr
4Jul 7, 2026 18:223,26417,566,0675,831,0002,330,0002,142,208stderr
5Jul 7, 2026 18:223,29417,563,1825,688,0002,547,0002,142,208stderr
6Jul 7, 2026 18:223,30417,602,2735,962,0002,299,0002,142,208stderr
7Jul 7, 2026 18:223,32417,648,6786,044,0002,266,0002,142,208stderr
8Jul 7, 2026 18:223,33117,783,6466,122,0002,207,0002,142,208stderr
9Jul 7, 2026 18:223,35617,723,7636,171,0002,219,0002,138,112stderr