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 listAug 21, 2026 19:30Andrew EpsteinAndrew EpsteinScore: 1,086,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2026 19:301,086,6522,727,106,1492,715,309,0001,323,0002,113,536
2Aug 21, 2026 19:301,086,6912,727,305,0592,715,725,0001,004,0002,113,536
3Aug 21, 2026 19:301,089,1532,733,302,1412,721,608,0001,276,0002,113,536