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 listApr 18, 2026 16:07Charles CabergsCharles CabergsScore: 15,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 16:0715,81963,307,19427,379,00012,168,0002,473,984
2Apr 18, 2026 16:0715,88969,078,04330,556,0009,166,0002,473,984
3Apr 18, 2026 16:0715,94764,428,13228,904,00010,963,0002,428,928
4Apr 18, 2026 16:0715,94859,307,26529,902,0009,967,0002,465,792
5Apr 18, 2026 16:0715,98665,598,70330,972,0008,992,0002,473,984
6Apr 18, 2026 16:0716,04861,686,87732,096,0008,024,0002,498,560
7Apr 18, 2026 16:0716,61869,851,38531,412,00010,132,0002,469,888
8Apr 18, 2026 16:0716,75869,779,36731,920,0009,975,0002,461,696
9Apr 18, 2026 16:0716,97671,756,55433,345,0009,094,0002,322,432