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 21:32Kenneth MaplesKenneth MaplesScore: 320,382Success
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 21:32320,379862,240,432800,947,56902,195,456
2Dec 24, 2023 21:32320,382866,195,981800,954,79202,187,264
3Dec 24, 2023 21:32320,400865,047,528800,999,04102,191,360