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 listAug 30, 2026 20:55Victor MerckléVictor MerckléScore: 1,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 20:581,92313,088,2283,133,0001,675,0002,146,304stderr
2Aug 30, 2026 20:581,93213,207,7603,131,0001,699,0002,146,304stderr
3Aug 30, 2026 20:581,95113,244,6113,202,0001,677,0002,146,304stderr
4Aug 30, 2026 20:581,96013,319,0663,211,0001,689,0002,146,304stderr
5Aug 30, 2026 20:581,99913,369,3953,264,0001,734,0002,146,304stderr
6Aug 30, 2026 20:582,00813,410,6803,219,0001,803,0002,146,304stderr
7Aug 30, 2026 20:582,00813,660,0383,276,0001,744,0002,146,304stderr
8Aug 30, 2026 20:582,01713,508,3773,289,0001,754,0002,146,304stderr
9Aug 30, 2026 20:582,02513,518,8783,229,0001,835,0002,146,304stderr