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 listDec 30, 2025 22:46Aniruddha DebAniruddha DebScore: 3,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 22:463,59325,008,6286,987,0001,996,0002,424,832
2Dec 30, 2025 22:583,59530,101,8046,991,0001,997,0002,281,472
3Dec 30, 2025 22:583,59628,628,4896,993,0001,998,0002,424,832
4Dec 30, 2025 22:473,60024,832,4556,000,0003,000,0002,428,928
5Dec 30, 2025 22:453,61226,174,7787,024,0002,007,0002,277,376
6Dec 30, 2025 22:453,61722,499,3776,029,0003,014,0002,420,736
7Dec 30, 2025 22:473,62624,301,8546,043,0003,021,0002,281,472
8Dec 30, 2025 22:463,63925,348,4127,076,0002,021,0002,277,376
9Dec 30, 2025 22:453,68024,486,0547,156,0002,044,0002,420,736
10Dec 30, 2025 22:583,71825,942,0407,229,0002,065,0002,281,472
11Dec 30, 2025 22:473,72926,605,8616,215,0003,107,0002,502,656
12Dec 30, 2025 22:463,98425,959,2627,968,0001,992,0002,535,424