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 12, 2024 23:58Joad NacerJoad NacerScore: 31,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 23:4731,943107,613,60776,863,0002,994,0002,424,832
2Dec 12, 2024 23:4731,952101,605,08578,883,000998,0002,510,848
3Dec 12, 2024 23:4731,962102,359,62178,907,000998,0002,424,832
4Dec 12, 2024 23:4731,975106,176,19176,940,0002,997,0002,433,024
5Dec 12, 2024 23:5831,982101,544,57278,957,000999,0002,396,160
6Dec 12, 2024 23:4731,983103,579,21775,909,0004,048,0002,486,272
7Dec 12, 2024 23:5831,985105,261,59478,963,000999,0002,465,792
8Dec 12, 2024 23:4731,987103,537,15877,968,0001,999,0002,494,464
9Dec 12, 2024 23:4731,989102,955,22977,973,0001,999,0002,498,560
10Dec 12, 2024 23:4732,068118,872,25878,166,0002,004,0002,437,120
11Dec 12, 2024 23:4732,070103,857,42778,171,0002,004,0002,465,792
12Dec 12, 2024 23:5832,238104,477,34180,595,00002,392,064