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:31limanjun99limanjun99Score: 3,034Success
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:312,99832,771,6806,425,0001,070,0002,527,232
2Apr 13, 2026 15:313,03424,662,4306,501,0001,083,0002,293,760
3Apr 13, 2026 15:313,04330,127,3105,434,0002,173,0002,293,760