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 6, 2026 16:10Josu San MartinJosu San MartinScore: 3,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 16:092,91726,645,4675,209,0002,083,0002,424,832
2Feb 6, 2026 16:092,92321,481,4744,176,0003,132,0002,330,624
3Feb 6, 2026 16:082,94321,308,7514,204,0003,153,0002,428,928
4Feb 6, 2026 16:102,94326,357,5905,256,0002,102,0002,433,024
5Feb 6, 2026 16:092,94625,371,2575,260,0002,104,0002,437,120
6Feb 6, 2026 16:082,95421,980,2223,165,0004,220,0002,523,136
7Feb 6, 2026 16:082,96921,893,4525,302,0002,120,0002,428,928
8Feb 6, 2026 16:093,01927,781,9476,470,0001,078,0002,428,928
9Feb 6, 2026 16:093,02924,106,5806,491,0001,081,0002,535,424
10Feb 6, 2026 16:103,03524,574,9447,587,00002,506,752
11Feb 6, 2026 16:103,04028,219,0657,600,00002,301,952
12Feb 6, 2026 16:093,04727,537,3676,529,0001,088,0002,506,752
13Feb 6, 2026 16:093,05023,958,4175,447,0002,178,0002,297,856
14Feb 6, 2026 16:093,05624,451,6126,549,0001,091,0002,420,736
15Feb 6, 2026 16:093,06228,309,9085,468,0002,187,0002,428,928