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 listAug 18, 2024 13:53Chandrasekaran AkashChandrasekaran AkashScore: 1,676,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2024 13:531,676,1284,237,576,3864,190,318,87802,174,976
2Aug 18, 2024 13:531,676,5094,250,209,0644,191,272,10802,174,976
3Aug 18, 2024 13:531,676,7494,258,449,1484,191,871,72202,301,952