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:40Yuriy LyfenkoYuriy LyfenkoScore: 546,116Success
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:40546,0711,420,684,1371,365,177,65502,285,568
2Jul 10, 2023 17:40546,1161,418,063,1341,365,289,28302,273,280
3Jul 10, 2023 17:40546,1211,427,407,4131,365,301,99202,277,376