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 3, 2023 20:07Sergey StreminSergey StreminScore: 49,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2023 20:0749,528154,148,639117,828,0005,991,0002,433,024
2Dec 3, 2023 20:0749,531147,287,596121,830,0001,997,0002,379,776
3Dec 3, 2023 20:0749,572151,617,904119,934,0003,997,0002,330,624
4Dec 3, 2023 20:0749,578153,227,339117,949,0005,997,0002,277,376
5Dec 3, 2023 20:0749,588151,034,595119,971,0003,999,0002,269,184
6Dec 3, 2023 20:0749,600147,801,484119,000,0005,000,0002,293,760
7Dec 3, 2023 20:0749,706152,618,491123,262,0001,002,0002,371,584
8Dec 3, 2023 20:0749,729153,957,112120,313,0004,010,0002,310,144
9Dec 3, 2023 20:0749,761149,299,131120,390,0004,013,0002,433,024
10Dec 3, 2023 20:0749,867188,194,283124,667,95602,293,760
11Dec 3, 2023 20:0749,964184,156,903124,910,20102,277,376
12Dec 3, 2023 20:0750,454182,886,228126,135,63602,301,952