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 09:18limanjun99limanjun99Score: 3,219Success
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 09:183,10425,314,7255,542,0002,217,0002,523,136
2Apr 13, 2026 09:183,21931,289,2585,030,0003,018,0002,269,184
3Apr 13, 2026 09:183,25625,359,3495,087,0003,052,0002,285,568