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:59Josu San MartinJosu San MartinScore: 27,433Success
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:5927,28995,290,56862,204,0006,019,0002,514,944
2Dec 29, 2025 15:5927,43394,212,04360,515,0008,068,0002,297,856
3Dec 29, 2025 15:5927,56291,238,02258,920,0009,986,0002,506,752