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:08Josu San MartinJosu San MartinScore: 27,393Success
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:0827,35092,788,56362,343,0006,033,0002,465,792
2Dec 29, 2025 16:0827,39394,344,97361,434,0007,049,0002,326,528
3Dec 29, 2025 16:0828,03899,303,16666,089,0004,005,0002,514,944