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 listFeb 5, 2026 04:45Josu San MartinJosu San MartinScore: 5,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:455,46328,509,88512,608,0001,050,0002,400,256
2Feb 5, 2026 04:455,57230,178,5509,951,0003,980,0002,527,232
3Feb 5, 2026 04:455,59345,412,17511,985,0001,997,0002,400,256