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 16:01Josu San MartinJosu San MartinScore: 27,475Success
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 16:0127,46298,650,88561,587,0007,067,0002,359,296
2Dec 29, 2025 16:0127,47591,588,32460,607,0008,081,0002,514,944
3Dec 29, 2025 16:0127,54692,677,18560,881,0007,984,0002,379,776