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 listMar 27, 2026 16:58Dominique GarmierDominique GarmierScore: 16,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 20:4216,63363,543,28338,540,0003,042,0002,297,856
2Mar 27, 2026 16:5816,65667,111,26638,594,0003,046,0002,293,760
3Mar 26, 2026 10:3816,65866,979,50838,599,0003,047,0002,473,984
4Mar 25, 2026 21:0716,66768,897,49938,619,0003,048,0002,387,968
5Mar 25, 2026 18:5616,68062,945,99239,665,0002,034,0002,297,856
6Mar 25, 2026 21:0716,69672,279,11039,705,0002,036,0002,297,856
7Mar 25, 2026 21:0716,75368,524,02538,892,0002,991,0002,293,760
8Mar 25, 2026 18:5616,75467,134,05639,890,0001,994,0002,306,048
9Mar 26, 2026 10:3816,79269,360,23838,981,0002,998,0002,301,952
10Mar 25, 2026 20:4216,80169,156,30039,003,0003,000,0002,297,856
11Mar 25, 2026 20:4216,88459,880,11039,195,0003,015,0002,297,856
12Mar 27, 2026 16:5816,90565,294,23039,245,0003,018,0002,293,760
13Mar 26, 2026 10:3816,96563,545,92239,384,0003,029,0002,297,856
14Mar 27, 2026 16:5816,97865,336,65539,414,0003,031,0002,490,368
15Mar 25, 2026 18:5617,22465,855,28240,057,0003,004,0002,293,760