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 18:22Yuriy LyfenkoYuriy LyfenkoScore: 588,408Success
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 18:22588,3961,534,720,7391,470,989,58702,277,376
2Jul 10, 2023 18:22588,4081,542,310,1851,471,020,98602,269,184
3Jul 10, 2023 18:22588,5021,537,855,9851,471,254,30502,273,280