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 listJun 29, 2026 00:34Victor MerckléVictor MerckléScore: 4,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 00:384,14219,647,6736,644,0003,711,0002,187,264
2Jun 29, 2026 00:384,18519,698,6576,825,0003,638,0002,129,920
3Jun 29, 2026 00:384,20519,751,2866,723,0003,791,0002,183,168
4Jun 29, 2026 00:384,23019,817,5536,891,0003,686,0002,138,112
5Jun 29, 2026 00:384,24419,872,2746,898,0003,714,0002,138,112
6Jun 29, 2026 00:384,29519,964,5887,040,0003,698,0002,129,920
7Jun 29, 2026 00:384,32520,041,1317,024,0003,790,0002,129,920
8Jun 29, 2026 00:384,34420,092,5507,519,0003,342,0002,187,264
9Jun 29, 2026 00:384,36020,171,9047,052,0003,850,0002,183,168