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 listMar 6, 2024 09:13Huy Duc LeHuy Duc LeScore: 26,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 09:1325,631123,991,83664,078,18302,248,704
2Mar 6, 2024 09:1325,720129,851,03164,300,89302,252,800
3Mar 6, 2024 09:1325,777139,231,66864,443,45102,244,608
4Mar 6, 2024 09:1326,25799,276,14156,554,0009,089,0002,334,720
5Mar 6, 2024 09:1326,332103,625,78355,855,0009,974,0002,392,064
6Mar 6, 2024 09:1326,33695,111,03849,878,00015,961,0002,461,696
7Mar 6, 2024 09:1326,33893,673,34052,875,00012,969,0002,396,160
8Mar 6, 2024 09:1326,33994,669,93752,878,00012,970,0002,301,952
9Mar 6, 2024 09:1326,35997,083,53053,916,00011,981,0002,502,656
10Mar 6, 2024 09:1326,37497,252,43651,949,00013,986,0002,441,216
11Mar 6, 2024 09:1326,41493,823,05050,026,00016,008,0002,379,776
12Mar 6, 2024 09:1326,41895,087,33052,037,00014,009,0002,269,184