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 listOct 16, 2024 10:27Huy Duc LeHuy Duc LeScore: 24,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2024 10:2724,34085,956,81350,876,0009,975,0002,326,528
2Oct 16, 2024 10:2724,36888,102,55848,935,00011,984,0002,416,640
3Oct 16, 2024 10:2724,39592,592,25847,991,00012,997,0002,445,312
4Oct 16, 2024 10:2724,42591,887,53350,051,00011,011,0002,396,160
5Oct 16, 2024 10:2724,43693,076,11552,076,0009,013,0002,322,432
6Oct 16, 2024 10:2724,52693,096,39349,253,00012,062,0002,326,528
7Oct 16, 2024 10:2724,57389,765,85947,333,00014,099,0002,326,528
8Oct 16, 2024 10:2724,61492,115,54251,448,00010,087,0002,494,464
9Oct 16, 2024 10:2724,79686,641,24850,992,00010,998,0002,322,432