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:38Yuriy LyfenkoYuriy LyfenkoScore: 61,901Success
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:3861,508177,260,987142,788,00010,983,0002,469,888
2Jul 12, 2023 22:3861,610183,565,190145,023,0009,001,0002,457,600
3Jul 12, 2023 22:3861,646182,986,685143,108,00011,008,0002,424,832
4Jul 12, 2023 22:3861,666182,912,098145,157,0009,009,0002,281,472
5Jul 12, 2023 22:3861,669181,058,903145,162,0009,010,0002,314,240
6Jul 12, 2023 22:3861,704181,240,567144,243,00010,016,0002,510,848
7Jul 12, 2023 22:3861,901220,401,787154,753,24402,297,856
8Jul 12, 2023 22:3861,914179,440,744143,801,00010,984,0002,314,240
9Jul 12, 2023 22:3861,990183,141,604143,977,00010,998,0002,310,144
10Jul 12, 2023 22:3862,031228,057,877155,077,81902,306,048
11Jul 12, 2023 22:3862,419183,405,232145,044,00011,003,0002,396,160
12Jul 12, 2023 22:3863,423227,016,389158,557,29002,293,760