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:58Josu San MartinJosu San MartinScore: 27,535Success
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:5827,48890,506,57559,624,0009,095,0002,506,752
2Dec 29, 2025 15:5827,53594,206,57759,859,0008,978,0002,527,232
3Dec 29, 2025 15:5827,94894,470,87263,881,0005,988,0002,514,944