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:36Viktor IarmolaViktor IarmolaScore: 1,651,950Success
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:361,651,5494,193,590,0554,128,871,62802,252,800
2Dec 6, 2023 09:361,651,9504,192,438,5084,129,875,90202,252,800
3Dec 6, 2023 09:361,651,9954,192,603,2704,129,988,10102,252,800