Points: 20 (partial)
Time limit: 1.0s
Memory limit: 256M
Assembly, Brain****, C, C++, Pascal, Rust
For a while now,
show off demonstrate his fast multiplication code, has created a problem that really tests the accuracy and speed of your fast multiplication code.
The first line of input will have .
The second line of input will have .
Both and will be non-negative integers strictly less than .
Output the product .
Could NASM and or NASM64 be allowed?
Hmmm. Is it possible for you to allow Lua on this question? Or is it not possible?