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 9, 2023 23:05gchebanovgchebanovScore: 19,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 23:0519,32273,891,14543,274,0005,031,0002,383,872
2Jul 9, 2023 23:0519,43973,940,25441,511,0007,087,0002,457,600
3Jul 9, 2023 23:0519,54075,651,78042,868,0005,981,0002,461,696
4Jul 9, 2023 23:0519,54078,872,34939,879,0008,972,0002,490,368
5Jul 9, 2023 23:0519,73870,095,38841,288,0008,056,0002,375,680
6Jul 9, 2023 23:0519,77071,976,19241,356,0008,069,0002,342,912
7Jul 9, 2023 23:0519,994110,320,67749,986,13602,224,128
8Jul 9, 2023 23:0520,03773,979,66739,073,00011,020,0002,437,120
9Jul 9, 2023 23:0520,07872,820,60842,163,0008,031,0002,383,872
10Jul 9, 2023 23:0520,293130,310,68150,732,53002,220,032
11Jul 9, 2023 23:0520,39778,878,77739,994,00010,998,0002,486,272
12Jul 9, 2023 23:0520,540124,756,67951,350,43402,220,032