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 listJan 1, 2026 20:57Josu San MartinJosu San MartinScore: 11,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:5711,68454,126,28624,173,0005,036,0002,326,528
2Jan 1, 2026 20:5711,68955,350,36023,176,0006,046,0002,514,944
3Jan 1, 2026 20:5711,69161,084,65624,189,0005,039,0002,494,464
4Jan 1, 2026 20:5711,71754,400,04621,212,0008,081,0002,310,144
5Jan 1, 2026 20:5711,74154,904,80625,304,0004,048,0002,514,944
6Jan 1, 2026 20:5711,74255,783,24621,257,0008,098,0002,473,984
7Jan 1, 2026 20:5711,74353,982,81923,284,0006,074,0002,478,080
8Jan 1, 2026 20:5711,74865,015,18524,307,0005,064,0002,478,080
9Jan 1, 2026 20:5712,38556,417,07222,973,0007,990,0002,514,944