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:16Huy Duc LeHuy Duc LeScore: 26,246Success
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:1626,11895,176,27351,231,00014,063,0002,355,200
2Mar 6, 2024 09:1626,15193,882,04156,325,0009,052,0002,310,144
3Mar 6, 2024 09:1626,16598,339,44454,343,00011,069,0002,289,664
4Mar 6, 2024 09:1626,17095,157,95855,361,00010,065,0002,433,024
5Mar 6, 2024 09:1626,19996,162,84655,422,00010,076,0002,420,736
6Mar 6, 2024 09:1626,22795,984,67853,463,00012,104,0002,510,848
7Mar 6, 2024 09:1626,24698,169,21952,493,00013,123,0002,465,792
8Mar 6, 2024 09:1626,28294,641,41751,553,00014,151,0002,514,944
9Mar 6, 2024 09:1626,33495,717,91954,864,00010,972,0002,277,376
10Mar 6, 2024 09:1626,378138,041,02265,946,18202,273,280
11Mar 6, 2024 09:1626,405130,188,48566,012,20502,256,896
12Mar 6, 2024 09:1626,452119,035,98266,129,47302,265,088