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 21, 2026 18:46Jacob McDanielJacob McDanielScore: 2,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:462,44916,279,4354,923,0001,201,0002,117,632
2May 21, 2026 18:462,45216,308,0334,935,0001,195,0002,117,632
3May 21, 2026 18:462,47417,268,6014,969,0001,216,0002,117,632
4May 21, 2026 18:462,49315,592,7505,009,0001,225,0002,117,632
5May 21, 2026 18:462,57217,241,4595,168,0001,263,0002,117,632
6May 21, 2026 18:462,58816,082,7195,192,0001,280,0002,117,632
7May 21, 2026 18:462,59818,144,8505,222,0001,273,0002,117,632
8May 21, 2026 18:462,61118,973,9055,251,0001,278,0002,117,632
9May 21, 2026 18:462,63318,685,3615,293,0001,291,0002,117,632