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:30Aniruddha DebAniruddha DebScore: 6,405Success
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:306,38046,897,24112,960,0002,990,0002,412,544
2Jul 1, 2025 20:306,40534,607,72813,011,0003,002,0002,408,448
3Jul 1, 2025 20:306,42935,879,10012,054,0004,018,0002,424,832