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 listMay 4, 2026 11:25Victor MerckléVictor MerckléScore: 83,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 11:2882,981215,444,669204,432,0003,022,0002,584,576stderr
2May 4, 2026 11:2883,005215,536,228204,404,0003,109,0002,564,096stderr
3May 4, 2026 11:2883,030215,534,676204,553,0003,024,0002,580,480stderr
4May 4, 2026 11:2883,067215,664,564204,611,0003,057,0002,572,288stderr
5May 4, 2026 11:2883,067215,705,218204,622,0003,046,0002,564,096stderr
6May 4, 2026 11:2883,068217,779,170204,647,0003,023,0002,568,192stderr
7May 4, 2026 11:2883,093215,720,974204,614,0003,120,0002,576,384stderr
8May 4, 2026 11:2883,136215,879,354204,699,0003,143,0002,568,192stderr
9May 4, 2026 11:2883,206216,041,896204,927,0003,090,0002,564,096stderr