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 listOct 16, 2024 10:25Huy Duc LeHuy Duc LeScore: 24,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 10:2524,34886,836,05749,895,00010,976,0002,510,848
2Oct 16, 2024 10:2524,38390,192,97051,964,0008,993,0002,359,296
3Oct 16, 2024 10:2524,45390,931,27854,118,0007,015,0002,314,240
4Oct 16, 2024 10:2524,50788,630,73950,219,00011,048,0002,351,104
5Oct 16, 2024 10:2524,51997,733,22749,240,00012,058,0002,519,040
6Oct 16, 2024 10:2524,53385,015,58351,278,00010,054,0002,318,336
7Oct 16, 2024 10:2524,53786,551,83652,292,0009,050,0002,318,336
8Oct 16, 2024 10:2524,60788,230,37648,407,00013,110,0002,379,776
9Oct 16, 2024 10:2524,60991,936,20146,394,00015,128,0002,342,912