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 listJan 7, 2024 21:39Oleg KovalovOleg KovalovScore: 1,688,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2024 21:391,687,5414,287,027,9484,218,851,52602,236,416
2Jan 7, 2024 21:391,688,3934,282,937,8274,220,981,68602,232,320
3Jan 7, 2024 21:391,688,6424,284,993,3034,221,605,33302,228,224