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 1, 2026 13:11Victor MerckléVictor MerckléScore: 4,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 13:154,10426,573,3597,184,0003,078,0002,367,488
2May 1, 2026 13:154,10926,603,9885,137,0005,137,0002,560,000
3May 1, 2026 13:154,12028,264,2784,120,0006,181,0002,564,096
4May 1, 2026 13:154,13028,981,7488,261,0002,065,0002,560,000
5May 1, 2026 13:154,13423,356,8504,134,0006,201,0002,355,200
6May 1, 2026 13:154,15830,820,1195,198,0005,198,0002,306,048
7May 1, 2026 13:154,16022,777,0796,240,0004,160,0002,375,680
8May 1, 2026 13:154,19526,911,3756,293,0004,195,0002,342,912
9May 1, 2026 13:154,22030,970,8978,442,0002,110,0002,301,952