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 21:56Jacob McDanielJacob McDanielScore: 2,467Success
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 21:572,44817,648,1654,925,0001,197,0002,117,632
2May 21, 2026 21:572,44816,356,4944,930,0001,190,0002,117,632
3May 21, 2026 21:572,45216,000,8424,932,0001,199,0002,117,632
4May 21, 2026 21:572,45716,959,1354,940,0001,204,0002,117,632
5May 21, 2026 21:572,46715,950,7214,965,0001,203,0002,117,632
6May 21, 2026 21:572,49215,494,4965,006,0001,224,0002,117,632
7May 21, 2026 21:572,50416,279,8315,080,0001,181,0002,117,632
8May 21, 2026 21:572,65318,950,6845,336,0001,297,0002,117,632
9May 21, 2026 21:572,73228,972,3315,667,0001,165,0002,117,632