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:32limanjun99limanjun99Score: 3,013Success
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:322,99826,349,1355,354,0002,141,0002,527,232
2Apr 13, 2026 15:323,01324,356,3045,381,0002,152,0002,293,760
3Apr 13, 2026 15:323,16429,633,9055,932,0001,977,0002,293,760