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:10Yuriy LyfenkoYuriy LyfenkoScore: 62,134Success
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:1061,945220,414,347154,863,66102,289,664
2Jul 12, 2023 22:1061,959182,123,909145,903,0008,994,0002,527,232
3Jul 12, 2023 22:1061,969180,170,807139,930,00014,992,0002,322,432
4Jul 12, 2023 22:1062,038183,422,347144,090,00011,006,0002,428,928
5Jul 12, 2023 22:1062,067181,473,045145,158,00010,010,0002,306,048
6Jul 12, 2023 22:1062,103224,692,591155,257,23602,297,856
7Jul 12, 2023 22:1062,134184,362,654147,317,0008,017,0002,326,528
8Jul 12, 2023 22:1062,138179,590,507144,320,00011,024,0002,375,680
9Jul 12, 2023 22:1062,152189,606,558142,431,00012,948,0002,314,240
10Jul 12, 2023 22:1062,187209,543,425155,467,30902,293,760
11Jul 12, 2023 22:1062,254179,402,269142,583,00013,053,0002,314,240
12Jul 12, 2023 22:1062,329177,235,364143,837,00011,986,0002,306,048