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 24, 2023 20:05Kenneth MaplesKenneth MaplesScore: 246,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 20:05246,302671,627,794615,753,89402,187,264
2Dec 24, 2023 20:05246,323682,467,457615,808,32902,195,456
3Dec 24, 2023 20:05246,404679,752,516616,010,25802,191,360