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:00Josu 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 16:0027,30296,814,64061,229,0007,026,0002,514,944
2Dec 29, 2025 16:0027,44693,900,30560,543,0008,072,0002,478,080
3Dec 29, 2025 16:0027,53693,452,85862,855,0005,986,0002,469,888