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:25Oleg KovalovOleg KovalovScore: 34,016Success
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:2533,936111,782,02281,847,0002,994,0002,347,008
2Jan 30, 2025 08:2534,016108,700,51184,040,0001,000,0002,461,696
3Jan 30, 2025 08:2534,454106,998,46985,134,0001,001,0002,338,816