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 24, 2023 19:08Kenneth MaplesKenneth MaplesScore: 747,544Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2023 19:08747,4641,934,351,2021,868,660,16402,199,552
2Dec 24, 2023 19:08747,5441,932,770,4261,868,860,61402,195,456
3Dec 24, 2023 19:08747,5931,931,439,0051,868,982,40802,199,552