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:38Kenneth MaplesKenneth MaplesScore: 321,045Success
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:38320,855866,603,647802,137,57802,236,416
2Dec 24, 2023 19:38321,045856,832,100802,611,90802,232,320
3Dec 24, 2023 19:38321,099867,033,657802,747,28902,228,224