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 listDec 29, 2025 21:25Aniruddha DebAniruddha DebScore: 6,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 21:256,36729,271,26913,929,0001,989,0002,539,520
2Dec 29, 2025 21:256,37336,510,03213,809,0002,124,0002,535,424
3Dec 29, 2025 21:256,40236,631,16913,005,0003,001,0002,531,328