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 3, 2023 20:02Sergey StreminSergey StreminScore: 49,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 20:0249,440148,794,765118,575,0005,024,0002,461,696
2Dec 3, 2023 20:0249,629152,352,226121,071,0003,001,0002,310,144
3Dec 3, 2023 20:0249,678149,886,701120,190,0004,006,0002,453,504
4Dec 3, 2023 20:0249,722153,423,018121,298,0003,007,0002,539,520
5Dec 3, 2023 20:0249,730148,527,653120,316,0004,010,0002,342,912
6Dec 3, 2023 20:0249,741187,015,608124,352,42102,306,048
7Dec 3, 2023 20:0249,745158,391,632120,351,0004,011,0002,342,912
8Dec 3, 2023 20:0249,747152,143,719121,359,0003,008,0002,420,736
9Dec 3, 2023 20:0249,787186,211,771124,466,79202,277,376
10Dec 3, 2023 20:0249,800158,188,224121,488,0003,012,0002,269,184
11Dec 3, 2023 20:0249,814154,320,431121,523,0003,012,0002,433,024
12Dec 3, 2023 20:0250,524180,234,320126,308,83002,232,320