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 listMar 6, 2024 09:20Huy Duc LeHuy Duc LeScore: 24,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2024 09:2024,041127,908,33660,103,29202,269,184
2Mar 6, 2024 09:2024,114127,785,02360,286,09202,260,992
3Mar 6, 2024 09:2024,177118,916,51460,443,15602,269,184
4Mar 6, 2024 09:2024,82588,971,26151,051,00011,011,0002,318,336
5Mar 6, 2024 09:2024,86887,980,42052,142,00010,027,0002,347,008
6Mar 6, 2024 09:2024,90490,661,45853,222,0009,037,0002,412,544
7Mar 6, 2024 09:2024,94989,548,38752,312,00010,060,0002,289,664
8Mar 6, 2024 09:2024,99789,316,45557,453,0005,039,0002,519,040
9Mar 6, 2024 09:2025,00094,898,79551,411,00011,088,0002,297,856
10Mar 6, 2024 09:2025,00792,573,51456,468,0006,050,0002,375,680
11Mar 6, 2024 09:2025,02296,099,39253,475,0009,080,0002,494,464
12Mar 6, 2024 09:2025,03693,679,24953,505,0009,085,0002,281,472