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 9, 2026 17:48Victor MerckléVictor MerckléScore: 4,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 17:524,29219,035,8349,494,0001,236,0002,121,728stderr
2Sep 9, 2026 17:524,29319,296,3709,500,0001,234,0002,121,728stderr
3Sep 9, 2026 17:524,29519,594,5679,511,0001,227,0002,121,728stderr
4Sep 9, 2026 17:524,30119,530,8969,507,0001,246,0002,121,728stderr
5Sep 9, 2026 17:524,30419,710,5619,523,0001,237,0002,121,728stderr
6Sep 9, 2026 17:524,31719,114,4789,545,0001,248,0002,121,728stderr
7Sep 9, 2026 17:524,32219,595,8749,538,0001,267,0002,121,728stderr
8Sep 9, 2026 17:524,32319,300,5539,563,0001,245,0002,121,728stderr
9Sep 9, 2026 17:524,33919,780,0629,595,0001,254,0002,121,728stderr