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 10, 2024 07:16LiamLiamScore: 1,651,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2024 07:161,651,5874,173,228,8654,128,966,53502,449,408
2Jan 10, 2024 07:161,651,8284,171,965,8034,129,570,23802,183,168
3Jan 10, 2024 07:161,669,5464,225,499,6224,173,865,54402,183,168