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 30, 2025 05:56Josu San MartinJosu San MartinScore: 62,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 05:5662,576182,269,044152,429,0004,011,0002,531,328
2Dec 30, 2025 05:5662,623184,756,791153,547,0003,010,0002,523,136
3Dec 30, 2025 05:5662,794180,389,171152,987,0003,999,0002,387,968