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 18:42Jacob McDanielJacob McDanielScore: 3,253Success
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 18:423,21219,311,1386,851,0001,181,0002,117,632
2May 17, 2026 18:423,21418,991,2096,842,0001,193,0002,117,632
3May 17, 2026 18:423,23618,956,8036,899,0001,193,0002,117,632
4May 17, 2026 18:423,24418,687,7636,897,0001,213,0002,117,632
5May 17, 2026 18:423,25318,103,2466,884,0001,250,0002,117,632
6May 17, 2026 18:423,25419,498,3086,936,0001,200,0002,117,632
7May 17, 2026 18:423,25617,271,5016,892,0001,249,0002,117,632
8May 17, 2026 18:423,29319,171,6036,938,0001,296,0002,117,632
9May 17, 2026 18:423,30818,262,8066,989,0001,281,0002,117,632