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:52Jacob McDanielJacob McDanielScore: 2,576Success
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:532,45317,900,9094,990,0001,144,0002,117,632
2May 21, 2026 18:532,45516,844,1804,934,0001,204,0002,117,632
3May 21, 2026 18:532,53017,605,7415,091,0001,236,0002,117,632
4May 21, 2026 18:532,56530,344,9955,154,0001,260,0002,117,632
5May 21, 2026 18:532,57616,615,1725,159,0001,283,0002,117,632
6May 21, 2026 18:532,58717,415,9725,204,0001,265,0002,117,632
7May 21, 2026 18:532,59917,457,3825,208,0001,290,0002,117,632
8May 21, 2026 18:532,62217,558,8395,267,0001,288,0002,117,632
9May 21, 2026 18:532,67529,418,5535,506,0001,182,0002,117,632