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:09Josu San MartinJosu San MartinScore: 27,374Success
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:0927,32593,016,50365,299,0003,013,0002,519,040
2Dec 29, 2025 16:0927,37492,428,70564,411,0004,025,0002,416,640
3Dec 29, 2025 16:0928,51499,203,21863,252,0008,032,0002,502,656