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 listMay 3, 2025 04:00KeefeKeefeScore: 20,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2025 04:0020,15381,212,78246,352,0004,030,0002,310,144
2May 3, 2025 04:0020,23978,013,25044,527,0006,071,0002,461,696
3May 3, 2025 04:0020,34375,540,28345,872,0004,986,0002,371,584
4May 3, 2025 04:0020,36680,154,23945,923,0004,991,0002,379,776
5May 3, 2025 04:0020,38479,200,72045,963,0004,996,0002,441,216
6May 3, 2025 04:0020,50776,390,26946,242,0005,026,0002,396,160
7May 3, 2025 04:0020,54886,405,19246,334,0005,036,0002,375,680
8May 3, 2025 04:0020,72283,108,04144,832,0006,973,0002,285,568
9May 3, 2025 04:0020,73481,078,30545,854,0005,981,0002,379,776