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 listJul 9, 2023 23:19gchebanovgchebanovScore: 14,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 23:1913,85063,745,20029,533,0005,091,0002,375,680
2Jul 9, 2023 23:1913,94158,490,09325,891,0008,962,0002,379,776
3Jul 9, 2023 23:1913,94561,598,71426,894,0007,968,0002,424,832
4Jul 9, 2023 23:1913,96467,173,62327,929,0006,982,0002,437,120
5Jul 9, 2023 23:1914,10261,476,27431,226,0004,029,0002,334,720
6Jul 9, 2023 23:1914,14257,046,09527,273,0008,081,0002,486,272
7Jul 9, 2023 23:1914,26563,120,87827,512,0008,151,0002,383,872
8Jul 9, 2023 23:1914,36861,204,22327,938,0007,982,0002,433,024
9Jul 9, 2023 23:1914,40598,376,95036,012,77902,224,128
10Jul 9, 2023 23:1914,412106,943,32136,029,10902,224,128
11Jul 9, 2023 23:1914,457103,277,87036,142,81802,220,032
12Jul 9, 2023 23:1914,51658,628,57127,218,0009,072,0002,379,776