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 listDec 12, 2024 23:56Joad NacerJoad NacerScore: 33,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 23:5633,749107,850,62784,372,00002,527,232
2Dec 12, 2024 23:5633,795112,320,49184,487,00002,433,024
3Dec 12, 2024 23:5634,049107,837,19782,118,0003,004,0002,351,104