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 7, 2026 20:53T PrathamT PrathamScore: 11,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 20:5310,86857,100,34522,139,0005,031,0002,375,680
2Feb 7, 2026 20:5311,02654,544,86424,502,0003,062,0002,396,160
3Feb 7, 2026 20:5311,34656,490,04425,325,0003,039,0002,301,952