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:01Josu San MartinJosu San MartinScore: 27,366Success
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:0127,32894,090,08359,277,0009,042,0002,465,792
2Dec 29, 2025 16:0127,36693,138,63662,379,0006,036,0002,330,624
3Dec 29, 2025 16:0127,61099,714,92762,022,0007,002,0002,519,040