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 6, 2023 09:55Viktor IarmolaViktor IarmolaScore: 2,088,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 09:552,086,4315,273,136,1645,216,077,83102,195,456
2Dec 6, 2023 09:552,088,2545,286,794,2085,220,635,66902,199,552
3Dec 6, 2023 09:552,088,4145,280,569,9805,221,035,23802,199,552