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 listJan 30, 2025 08:13Oleg KovalovOleg KovalovScore: 1,140,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 08:131,139,2972,877,156,4282,847,244,000999,0002,441,216
2Jan 30, 2025 08:131,140,8982,886,140,5822,851,246,000999,0002,555,904
3Jan 30, 2025 08:131,143,5982,884,791,5992,858,995,00002,551,808