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 20:25Kenneth MaplesKenneth MaplesScore: 244,878Success
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 20:25244,851679,308,169612,128,56302,285,568
2Dec 24, 2023 20:25244,878677,847,251612,194,60202,285,568
3Dec 24, 2023 20:25244,894677,079,295612,234,03302,285,568