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 15:51limanjun99limanjun99Score: 3,007Success
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 15:513,00630,043,9595,369,0002,147,0002,293,760
2Apr 13, 2026 15:513,00725,424,0496,444,0001,074,0002,293,760
3Apr 13, 2026 15:513,00824,622,3756,446,0001,074,0002,281,472