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:24Aniruddha DebAniruddha DebScore: 6,576Success
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:246,52237,417,67313,248,0003,057,0002,379,776
2Jul 1, 2025 20:246,57637,154,10412,331,0004,110,0002,449,408
3Jul 1, 2025 20:248,01543,543,62717,032,0003,005,0002,293,760