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 listNov 20, 2023 17:34Yuriy LyfenkoYuriy LyfenkoScore: 55,126Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2023 17:3454,773162,125,863125,939,00010,994,0002,449,408
2Nov 20, 2023 17:3454,855166,594,921126,127,00011,011,0002,293,760
3Nov 20, 2023 17:3454,923164,679,683128,287,0009,020,0002,281,472
4Nov 20, 2023 17:3455,017167,239,686130,515,0007,027,0002,314,240
5Nov 20, 2023 17:3455,032164,114,484127,538,00010,042,0002,285,568
6Nov 20, 2023 17:3455,111163,152,643125,798,00011,980,0002,277,376
7Nov 20, 2023 17:3455,126168,672,870129,827,0007,989,0002,428,928
8Nov 20, 2023 17:3455,162164,367,640125,914,00011,991,0002,449,408
9Nov 20, 2023 17:3455,170163,571,953127,931,0009,994,0002,293,760
10Nov 20, 2023 17:3457,724211,222,843144,310,18302,269,184
11Nov 20, 2023 17:3457,811206,324,344144,527,00902,269,184
12Nov 20, 2023 17:3457,883200,823,047144,707,24502,273,280