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 18, 2026 16:23Jacob McDanielJacob McDanielScore: 2,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 16:242,70415,964,9915,550,0001,210,0002,117,632
2May 18, 2026 16:242,71016,299,1775,578,0001,197,0002,117,632
3May 18, 2026 16:242,72016,354,2825,572,0001,228,0002,117,632
4May 18, 2026 16:242,74019,228,6845,612,0001,239,0002,117,632
5May 18, 2026 16:242,74317,440,8175,618,0001,241,0002,117,632
6May 18, 2026 16:242,79919,331,5595,748,0001,250,0002,117,632
7May 18, 2026 16:242,81717,888,6025,792,0001,251,0002,117,632
8May 18, 2026 16:242,82616,328,2115,799,0001,267,0002,117,632
9May 18, 2026 16:242,85217,022,4875,840,0001,292,0002,117,632