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:21Oleg KovalovOleg KovalovScore: 34,111Success
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:2133,990113,038,35582,976,0001,999,0002,473,984
2Jan 30, 2025 08:2134,111117,859,09082,268,0003,009,0002,510,848
3Jan 30, 2025 08:2134,324117,909,14882,781,0003,028,0002,469,888