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:02Aniruddha DebAniruddha DebScore: 6,797Success
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:026,78945,197,12310,982,0005,990,0002,416,640
2Jul 1, 2025 20:026,79739,942,06914,994,0001,999,0002,441,216
3Jul 1, 2025 20:026,82642,633,00212,045,0005,019,0002,441,216