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:57Josu San MartinJosu San MartinScore: 27,471Success
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:5727,399100,055,53359,432,0009,066,0002,363,392
2Dec 29, 2025 15:5727,47193,493,94358,579,00010,099,0002,514,944
3Dec 29, 2025 15:5727,47491,784,82159,595,0009,090,0002,396,160