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:09Josu San MartinJosu San MartinScore: 27,464Success
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:0927,37897,032,38360,392,0008,052,0002,519,040
2Dec 29, 2025 16:0927,46497,596,53757,553,00011,106,0002,502,656
3Dec 29, 2025 16:0928,16499,358,92960,353,00010,058,0002,506,752