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:02Josu San MartinJosu San MartinScore: 27,430Success
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:0227,39896,360,48662,451,0006,043,0002,273,280
2Dec 29, 2025 16:0227,43095,138,02558,491,00010,084,0002,514,944
3Dec 29, 2025 16:0228,25497,322,55264,580,0006,054,0002,519,040