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 listNov 29, 2024 22:36E SequeiraE SequeiraScore: 1,556,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 22:361,555,6463,911,470,2913,888,117,000999,0002,527,232
2Nov 29, 2024 22:361,556,3233,920,568,5473,889,808,000999,0002,342,912
3Nov 29, 2024 22:361,556,3273,923,004,6643,887,820,0002,998,0002,351,104