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:10Josu San MartinJosu San MartinScore: 27,543Success
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:1027,38494,398,22360,406,0008,054,0002,514,944
2Dec 29, 2025 16:1027,54394,241,27362,871,0005,987,0002,519,040
3Dec 29, 2025 16:1028,81195,317,61466,026,0006,002,0002,281,472