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 listMay 3, 2025 03:57KeefeKeefeScore: 26,475Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2025 03:5725,92593,674,08960,824,0003,988,0002,318,336
2May 3, 2025 03:5726,47594,291,81263,180,0003,008,0002,265,088
3May 3, 2025 03:5729,62198,774,45871,050,0003,002,0002,273,280