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 04:58Josu San MartinJosu San MartinScore: 71,225Success
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 04:5870,821207,263,989172,051,0005,001,0002,519,040
2Dec 23, 2025 04:5871,225204,337,232168,060,00010,003,0002,510,848
3Dec 23, 2025 04:5871,424209,407,342172,542,0006,018,0002,506,752