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 listJul 1, 2025 20:06Aniruddha DebAniruddha DebScore: 6,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2025 20:066,47142,446,63912,134,0004,044,0002,420,736
2Jul 1, 2025 20:066,53331,942,18513,271,0003,062,0002,404,352
3Jul 1, 2025 20:066,55137,381,79014,331,0002,047,0002,416,640