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 15:57Josu San MartinJosu San MartinScore: 27,440Success
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 15:5727,32593,238,08360,276,0008,036,0002,514,944
2Dec 29, 2025 15:5727,44098,607,37262,547,0006,053,0002,355,200
3Dec 29, 2025 15:5727,44696,354,09858,524,00010,090,0002,297,856