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 12, 2023 22:32Yuriy LyfenkoYuriy LyfenkoScore: 61,931Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 22:3261,708183,185,986142,250,00012,021,0002,318,336
2Jul 12, 2023 22:3261,728178,885,613145,303,0009,018,0002,445,312
3Jul 12, 2023 22:3261,764181,886,135143,381,00011,029,0002,486,272
4Jul 12, 2023 22:3261,782216,045,757154,454,28402,289,664
5Jul 12, 2023 22:3261,857217,750,803154,643,49702,285,568
6Jul 12, 2023 22:3261,919183,935,878143,812,00010,985,0002,310,144
7Jul 12, 2023 22:3261,931182,486,477142,841,00011,986,0002,355,200
8Jul 12, 2023 22:3261,965186,445,567139,921,00014,991,0002,293,760
9Jul 12, 2023 22:3261,976180,829,982143,944,00010,995,0002,285,568
10Jul 12, 2023 22:3262,007183,851,212144,017,00011,001,0002,322,432
11Jul 12, 2023 22:3262,316180,713,562145,804,0009,986,0002,437,120
12Jul 12, 2023 22:3263,108221,498,206157,769,11902,297,856