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:17Bernard TeoBernard TeoScore: 37,217Success
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:1736,068117,280,83188,166,0002,003,0002,400,256
2Jul 12, 2023 17:1736,076117,427,92988,185,0002,004,0002,297,856
3Jul 12, 2023 17:1736,101113,565,21989,251,0001,002,0002,347,008
4Jul 12, 2023 17:1736,173118,790,97889,428,0001,004,0002,400,256
5Jul 12, 2023 17:1736,348119,448,23689,871,000998,0002,330,624
6Jul 12, 2023 17:1737,150121,201,34591,877,000998,0002,347,008
7Jul 12, 2023 17:1737,217121,067,07191,042,0002,000,0002,330,624
8Jul 12, 2023 17:1737,251118,999,36391,125,0002,002,0002,314,240
9Jul 12, 2023 17:1737,978117,687,97193,945,000999,0002,314,240
10Jul 12, 2023 17:1738,526156,362,08796,316,23402,252,800
11Jul 12, 2023 17:1738,562157,782,18696,404,85502,240,512
12Jul 12, 2023 17:1739,178162,644,13897,944,14802,256,896