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 18:30Bernard TeoBernard TeoScore: 34,011Success
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 18:3033,950110,562,93583,878,000998,0002,297,856
2Jul 9, 2023 18:3033,952111,819,35783,881,000998,0002,330,624
3Jul 9, 2023 18:3033,963108,342,10483,909,000998,0002,392,064
4Jul 9, 2023 18:3033,970113,668,91484,926,00002,306,048
5Jul 9, 2023 18:3033,985112,856,44283,964,000999,0002,408,448
6Jul 9, 2023 18:3033,991112,188,88283,978,000999,0002,400,256
7Jul 9, 2023 18:3034,011114,143,40084,027,0001,000,0002,400,256
8Jul 9, 2023 18:3034,041109,655,56883,100,0002,002,0002,392,064
9Jul 9, 2023 18:3034,057111,567,67584,141,0001,001,0002,314,240
10Jul 9, 2023 18:3048,730195,125,709121,824,16102,256,896
11Jul 9, 2023 18:3048,771197,252,161121,927,35302,248,704
12Jul 9, 2023 18:3048,775183,281,975121,936,67902,252,800