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:06Josu San MartinJosu San MartinScore: 27,432Success
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:0627,25997,938,26759,129,0009,019,0002,531,328
2Dec 29, 2025 16:0627,43291,774,22763,537,0005,042,0002,514,944
3Dec 29, 2025 16:0627,43699,320,44063,548,0005,043,0002,502,656