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,423Success
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,30892,572,49662,246,0006,023,0002,519,040
2Dec 29, 2025 16:0827,42396,137,36961,500,0007,057,0002,514,944
3Dec 29, 2025 16:0828,03097,760,85858,062,00012,012,0002,506,752