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:10Aniruddha DebAniruddha DebScore: 6,559Success
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:106,54534,161,54413,295,0003,068,0002,457,600
2Jul 1, 2025 20:106,55935,544,09513,324,0003,074,0002,412,544
3Jul 1, 2025 20:106,59136,885,09911,328,0005,149,0002,277,376