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:32Jacob McDanielJacob McDanielScore: 2,492Success
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:322,48616,044,6495,009,0001,206,0002,117,632
2May 21, 2026 18:322,48617,503,9505,016,0001,200,0002,117,632
3May 21, 2026 18:322,48717,483,7465,022,0001,196,0002,117,632
4May 21, 2026 18:322,49115,825,5715,022,0001,206,0002,117,632
5May 21, 2026 18:322,49216,114,0895,021,0001,210,0002,117,632
6May 21, 2026 18:322,49416,233,9335,088,0001,147,0002,117,632
7May 21, 2026 18:322,50616,502,0095,053,0001,214,0002,117,632
8May 21, 2026 18:322,51217,779,9725,066,0001,215,0002,117,632
9May 21, 2026 18:322,62217,403,2625,292,0001,263,0002,117,632