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 12, 2026 13:48limanjun99limanjun99Score: 41,933Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 13:4841,861133,192,079102,640,0002,012,000913,408
2Apr 12, 2026 13:4841,933136,439,54998,843,0005,990,000823,296
3Apr 12, 2026 13:4841,937133,385,686102,845,0001,997,000839,680