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 18:16Sergey StreminSergey StreminScore: 52,257Success
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 18:1652,108159,527,411125,259,0005,010,0002,269,184
2Dec 3, 2023 18:1652,123204,293,195130,308,04102,301,952
3Dec 3, 2023 18:1652,136153,841,691127,334,0003,007,0002,469,888
4Dec 3, 2023 18:1652,184157,685,778127,449,0003,010,0002,355,200
5Dec 3, 2023 18:1652,187201,400,572130,467,22902,232,320
6Dec 3, 2023 18:1652,248159,284,512128,612,0002,009,0002,416,640
7Dec 3, 2023 18:1652,257159,231,924127,629,0003,014,0002,342,912
8Dec 3, 2023 18:1652,263159,127,242123,623,0007,035,0002,453,504
9Dec 3, 2023 18:1652,277159,276,836128,683,0002,010,0002,465,792
10Dec 3, 2023 18:1652,352162,662,301124,886,0005,994,0002,293,760
11Dec 3, 2023 18:1652,374159,590,266123,940,0006,996,0002,519,040
12Dec 3, 2023 18:1653,564204,211,746133,910,35302,326,528