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 19, 2026 21:09Jacob McDanielJacob McDanielScore: 2,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 21:102,70416,005,7585,576,0001,186,0002,117,632
2May 19, 2026 21:102,70417,682,8545,575,0001,186,0002,117,632
3May 19, 2026 21:102,71318,451,1695,586,0001,197,0002,117,632
4May 19, 2026 21:102,72417,851,8945,604,0001,208,0002,117,632
5May 19, 2026 21:102,72818,278,2365,615,0001,205,0002,117,632
6May 19, 2026 21:102,76117,900,3165,655,0001,248,0002,117,632
7May 19, 2026 21:102,76416,133,4075,663,0001,249,0002,117,632
8May 19, 2026 21:102,78317,722,5265,694,0001,265,0002,117,632
9May 19, 2026 21:102,84816,421,2185,835,0001,285,0002,117,632