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 listDec 29, 2025 17:48KeefeKeefeScore: 15,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 17:4815,74162,085,67434,308,0005,045,0002,342,912
2Dec 29, 2025 17:4815,77666,685,92234,385,0005,056,0002,342,912
3Dec 29, 2025 17:4815,80562,302,49337,487,0002,026,0002,412,544
4Dec 29, 2025 17:4815,81269,003,00934,462,0005,067,0002,310,144
5Dec 29, 2025 17:4815,81460,802,44636,493,0003,041,0002,310,144
6Dec 29, 2025 17:4815,99467,131,79635,986,0003,998,0002,342,912
7Dec 29, 2025 17:4816,02661,262,22034,056,0006,009,0002,293,760
8Dec 29, 2025 17:4816,07368,959,35136,164,0004,018,0002,404,352
9Dec 29, 2025 17:4816,13862,284,71936,311,0004,034,0002,351,104