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 listApr 13, 2026 10:12limanjun99limanjun99Score: 3,215Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 10:123,19524,916,3904,993,0002,995,0002,523,136
2Apr 13, 2026 10:123,21526,030,3665,024,0003,014,0002,293,760
3Apr 13, 2026 10:123,22725,116,2865,043,0003,025,0002,293,760