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:23Yuriy LyfenkoYuriy LyfenkoScore: 546,120Success
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:23546,0811,424,881,0151,365,203,58502,269,184
2Jul 10, 2023 18:23546,1201,408,027,7841,365,300,70902,277,376
3Jul 10, 2023 18:23546,1241,420,033,4651,365,310,10402,273,280