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:09Josu San MartinJosu San MartinScore: 27,447Success
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:0927,37298,470,03360,381,0008,050,0002,514,944
2Dec 29, 2025 16:0927,44797,596,40862,564,0006,054,0002,306,048
3Dec 29, 2025 16:0927,96298,843,69059,918,0009,986,0002,453,504