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 listNov 17, 2025 05:33Yuriy LyfenkoYuriy LyfenkoScore: 40,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2025 05:3340,449126,470,49596,116,0005,006,0002,482,176
2Nov 17, 2025 05:3340,616127,198,90193,498,0008,042,0002,486,272
3Nov 17, 2025 05:3340,629126,878,40593,527,0008,045,0002,359,296
4Nov 17, 2025 05:3340,668129,064,04695,632,0006,039,0002,486,272
5Nov 17, 2025 05:3340,673127,785,85796,698,0004,984,0002,396,160
6Nov 17, 2025 05:3340,724125,731,73993,826,0007,985,0002,478,080
7Nov 17, 2025 05:3340,727126,395,84996,826,0004,991,0002,281,472
8Nov 17, 2025 05:3340,973135,561,21595,403,0007,029,0002,363,392
9Nov 17, 2025 05:3341,023129,260,52796,526,0006,032,0002,301,952