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 10:07limanjun99limanjun99Score: 3,112Success
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 10:073,09031,270,5986,621,0001,103,0002,293,760
2Apr 13, 2026 10:073,11229,239,5935,557,0002,223,0002,527,232
3Apr 13, 2026 10:073,20826,189,6485,013,0003,007,0002,293,760