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:40Aniruddha DebAniruddha DebScore: 6,471Success
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:406,26734,372,00112,535,0003,133,0002,416,640
2Jul 1, 2025 20:406,47149,457,09313,145,0003,033,0002,277,376
3Jul 1, 2025 20:407,74739,771,80215,290,0004,077,0002,498,560