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 listJul 5, 2026 17:39Victor MerckléVictor MerckléScore: 1,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:411,62212,081,3892,901,0001,156,0002,117,632stderr
2Jul 5, 2026 17:411,62212,034,2292,905,0001,150,0002,117,632stderr
3Jul 5, 2026 17:411,62212,083,7702,900,0001,157,0002,117,632stderr
4Jul 5, 2026 17:411,62312,045,3992,910,0001,148,0002,117,632stderr
5Jul 5, 2026 17:411,62412,078,2342,906,0001,154,0002,117,632stderr
6Jul 5, 2026 17:411,63012,118,8502,912,0001,165,0002,117,632stderr
7Jul 5, 2026 17:411,71312,243,0143,099,0001,185,0002,117,632stderr
8Jul 5, 2026 17:411,71712,351,7433,096,0001,198,0002,117,632stderr
9Jul 5, 2026 17:411,75612,909,2583,183,0001,209,0002,117,632stderr