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 05:22limanjun99limanjun99Score: 6,178Success
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 05:226,11937,707,42212,238,0003,059,0002,293,760
2Apr 13, 2026 05:226,17832,549,87413,386,0002,059,0002,265,088
3Apr 13, 2026 05:226,18031,975,17813,391,0002,060,0002,265,088