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:03Josu San MartinJosu San MartinScore: 27,368Success
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:0327,35598,814,14362,354,0006,034,0002,326,528
2Dec 29, 2025 16:0327,36898,176,88963,390,0005,031,0002,342,912
3Dec 29, 2025 16:0328,214102,856,45160,460,00010,076,0002,514,944