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 08:21limanjun99limanjun99Score: 3,442Success
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 08:213,40726,087,8627,454,0001,064,0002,285,568
2Apr 13, 2026 08:213,44225,120,9916,454,0002,151,0002,289,664
3Apr 13, 2026 08:213,49426,258,9296,552,0002,184,0002,289,664