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:56Josu San MartinJosu San MartinScore: 27,446Success
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:5627,21590,618,36561,034,0007,003,0002,514,944
2Dec 29, 2025 15:5627,44697,988,40861,551,0007,063,0002,506,752
3Dec 29, 2025 15:5630,856130,856,71670,127,0007,012,0002,273,280