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:05Josu San MartinJosu San MartinScore: 27,417Success
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:0527,41692,746,20360,478,0008,063,0002,297,856
2Dec 29, 2025 16:0527,41794,373,22259,471,0009,071,0002,506,752
3Dec 29, 2025 16:0528,178102,787,56064,408,0006,038,0002,510,848