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 listMay 1, 2026 12:27Victor MerckléVictor MerckléScore: 10,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 12:2910,12433,419,88416,200,0009,112,0002,498,560
2May 1, 2026 12:2910,28433,792,35218,511,0007,199,0002,338,816
3May 1, 2026 12:2910,33833,975,43016,899,0008,946,0002,351,104
4May 1, 2026 12:2910,39640,015,15614,994,00010,996,0002,428,928
5May 1, 2026 12:2910,41334,194,55717,022,0009,011,0002,408,448
6May 1, 2026 12:2910,43047,214,43917,050,0009,026,0002,424,832
7May 1, 2026 12:2910,43243,263,86716,050,00010,031,0002,437,120
8May 1, 2026 12:2910,44443,212,79518,077,0008,034,0002,437,120
9May 1, 2026 12:2910,56234,578,86120,312,0006,093,0002,519,040