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 23, 2025 05:44Josu San MartinJosu San MartinScore: 51,621Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:4451,567156,946,091119,924,0008,994,0002,502,656
2Dec 23, 2025 05:4451,621153,655,689121,049,0008,003,0002,461,696
3Dec 23, 2025 05:4451,641151,635,597118,095,00011,008,0002,330,624