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 12, 2023 17:16Bernard TeoBernard TeoScore: 36,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 17:1636,048115,043,23589,120,0001,001,0002,330,624
2Jul 12, 2023 17:1636,090117,587,72789,224,0001,002,0002,297,856
3Jul 12, 2023 17:1636,116116,392,90689,288,0001,003,0002,396,160
4Jul 12, 2023 17:1636,144113,235,90789,356,0001,004,0002,519,040
5Jul 12, 2023 17:1636,190112,957,25489,471,0001,005,0002,314,240
6Jul 12, 2023 17:1636,190125,760,93290,476,00002,330,624
7Jul 12, 2023 17:1636,199111,191,02389,493,0001,005,0002,297,856
8Jul 12, 2023 17:1636,990112,281,00791,469,0001,005,0002,478,080
9Jul 12, 2023 17:1637,154117,247,15491,888,000998,0002,260,992
10Jul 12, 2023 17:1638,477166,037,74296,191,44202,232,320
11Jul 12, 2023 17:1638,504154,427,88996,260,62902,248,704
12Jul 12, 2023 17:1639,148156,033,57497,870,71102,248,704