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 07:39limanjun99limanjun99Score: 4,167Success
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 07:394,16435,995,5508,328,0002,082,0002,498,560
2Apr 13, 2026 07:394,16727,624,64310,418,00002,502,656
3Apr 13, 2026 07:394,17430,305,5298,349,0002,087,0002,285,568