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,952Success
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,784,36441,608,0003,044,0002,326,528
2Dec 30, 2025 05:2317,95270,102,08042,886,0001,994,0002,322,432
3Dec 30, 2025 05:2318,05069,557,51542,116,0003,008,0002,494,464