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:11Yuriy LyfenkoYuriy LyfenkoScore: 62,845Success
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:1162,642192,013,048143,554,00013,050,0002,355,200
2Jul 12, 2023 22:1162,710181,481,611143,795,00012,981,0002,318,336
3Jul 12, 2023 22:1162,768185,530,802149,925,0006,996,0002,437,120
4Jul 12, 2023 22:1162,787185,690,450141,971,00014,996,0002,514,944
5Jul 12, 2023 22:1162,809221,369,170157,022,36002,293,760
6Jul 12, 2023 22:1162,822187,107,606145,050,00012,004,0002,310,144
7Jul 12, 2023 22:1162,845223,513,516157,112,49002,289,664
8Jul 12, 2023 22:1162,915187,207,157147,269,00010,018,0002,408,448
9Jul 12, 2023 22:1162,942186,675,133146,331,00011,024,0002,314,240
10Jul 12, 2023 22:1163,073220,639,765157,681,44202,293,760
11Jul 12, 2023 22:1163,134185,217,092149,844,0007,991,0002,306,048
12Jul 12, 2023 22:1163,152188,298,316147,888,0009,992,0002,318,336