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 21:55Kenneth MaplesKenneth MaplesScore: 65,268Success
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 21:5564,738186,463,755153,852,0007,992,0002,293,760
2Dec 24, 2023 21:5564,983190,105,022154,435,0008,022,0002,297,856
3Dec 24, 2023 21:5565,001187,270,249154,478,0008,024,0002,293,760
4Dec 24, 2023 21:5565,122192,550,299161,808,000998,0002,293,760
5Dec 24, 2023 21:5565,178189,596,908154,947,0007,997,0002,342,912
6Dec 24, 2023 21:5565,233188,000,659156,079,0007,003,0002,486,272
7Dec 24, 2023 21:5565,268184,065,006154,160,0009,009,0002,301,952
8Dec 24, 2023 21:5565,285189,787,381153,200,00010,013,0002,342,912
9Dec 24, 2023 21:5565,298185,913,145156,234,0007,010,0002,338,816
10Dec 24, 2023 21:5565,807220,156,546164,518,39802,199,552
11Dec 24, 2023 21:5565,816220,058,353164,540,96602,183,168
12Dec 24, 2023 21:5565,849232,908,048164,621,74602,199,552