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 19, 2026 21:08Jacob McDanielJacob McDanielScore: 2,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 21:082,75316,173,1885,717,0001,167,0002,117,632
2May 19, 2026 21:082,76217,127,1435,695,0001,211,0002,117,632
3May 19, 2026 21:082,76216,623,3835,686,0001,220,0002,117,632
4May 19, 2026 21:082,76616,157,9755,679,0001,237,0002,117,632
5May 19, 2026 21:082,77017,549,6285,693,0001,233,0002,117,632
6May 19, 2026 21:082,78117,445,8715,724,0001,229,0002,117,632
7May 19, 2026 21:082,78918,271,1395,725,0001,248,0002,117,632
8May 19, 2026 21:082,81316,307,1545,742,0001,291,0002,117,632
9May 19, 2026 21:082,85218,274,6185,833,0001,297,0002,117,632