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 27, 2025 19:28Oleg KovalovOleg KovalovScore: 3,247,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 19:283,246,4528,147,049,7778,114,131,0001,999,0002,289,664
2Jan 27, 2025 19:283,247,4918,151,652,8768,117,728,000999,0002,285,568
3Jan 27, 2025 19:283,256,3578,169,682,5488,138,894,0001,998,0002,428,928