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 30, 2025 05:23Josu San MartinJosu San MartinScore: 17,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:2317,86175,918,06339,579,0005,074,0002,326,528
2Dec 30, 2025 05:2317,86669,910,14442,634,0002,030,0002,330,624
3Dec 30, 2025 05:2319,01882,740,10043,498,0004,046,0002,330,624