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 17, 2026 21:39Jacob McDanielJacob McDanielScore: 3,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:393,20917,951,8016,856,0001,167,0002,117,632
2May 17, 2026 21:393,23217,330,9536,917,0001,165,0002,117,632
3May 17, 2026 21:393,23817,271,5476,922,0001,175,0002,117,632
4May 17, 2026 21:393,29619,230,0567,000,0001,241,0002,117,632
5May 17, 2026 21:393,29618,062,3666,997,0001,243,0002,117,632
6May 17, 2026 21:393,30817,878,9107,027,0001,244,0002,117,632
7May 17, 2026 21:393,31819,700,0667,063,0001,234,0002,117,632
8May 17, 2026 21:393,33317,576,8427,094,0001,239,0002,113,536
9May 17, 2026 21:393,36517,668,3647,141,0001,273,0002,117,632