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 14:56limanjun99limanjun99Score: 3,166Success
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 14:563,04727,837,0935,441,0002,176,0002,465,792
2Apr 13, 2026 14:563,16626,377,2694,948,0002,968,0002,285,568
3Apr 13, 2026 14:563,19223,112,7114,988,0002,993,0002,293,760