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 listJul 10, 2023 17:27Yuriy LyfenkoYuriy LyfenkoScore: 546,142Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2023 17:27546,0951,424,840,8641,365,236,57102,269,184
2Jul 10, 2023 17:27546,1421,418,649,3271,365,354,39602,256,896
3Jul 10, 2023 17:27546,6041,444,157,4221,366,510,62202,269,184