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 4, 2024 12:14Andrey LikhachevAndrey LikhachevScore: 149,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2024 12:14149,517441,866,490373,792,29802,281,472
2Jan 4, 2024 12:14149,522450,191,266373,805,86602,211,840
3Jan 4, 2024 12:14149,532433,760,612373,828,85602,203,648