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 11:30limanjun99limanjun99Score: 3,827Success
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 11:303,82425,826,8227,435,0002,124,0002,519,040
2Apr 13, 2026 11:303,82726,897,1957,442,0002,126,0002,293,760
3Apr 13, 2026 11:303,97727,335,0527,954,0001,988,0002,293,760