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:09limanjun99limanjun99Score: 3,050Success
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:093,03623,213,9395,421,0002,168,0002,293,760
2Apr 13, 2026 15:093,05023,633,4856,536,0001,089,0002,527,232
3Apr 13, 2026 15:093,17031,440,5675,943,0001,981,0002,269,184