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:22Josu San MartinJosu San MartinScore: 31,150Success
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:2230,993100,361,16475,470,0002,012,0002,453,504
2Dec 30, 2025 05:2231,150105,136,58271,885,0005,990,0002,326,528
3Dec 30, 2025 05:2231,258102,340,43575,140,0003,005,0002,277,376