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:18Kenneth MaplesKenneth MaplesScore: 244,985Success
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:18244,951686,056,087612,378,08702,195,456
2Dec 24, 2023 20:18244,985667,709,982612,462,00502,191,360
3Dec 24, 2023 20:18245,043667,858,706612,607,82202,191,360