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 listApr 30, 2026 19:06Victor MerckléVictor MerckléError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 05:37Tomislav Tunkovic31.75CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 06:07034,794,15322,676,0002,139,0002,113,536pos 143642: expected 0 got 255
2Sep 5, 2026 06:07034,836,04921,720,0003,129,0002,113,536pos 18: expected 0 got 1
3Apr 30, 2026 19:069,92141,124,58222,819,0001,984,0002,392,064
4Apr 30, 2026 19:069,92341,755,74118,855,0005,954,0002,396,160
5Apr 30, 2026 19:069,92747,854,86617,870,0006,949,0002,392,064
6Apr 30, 2026 19:069,93445,980,04819,663,0005,174,0002,383,872
7Apr 30, 2026 19:069,94944,788,51317,909,0006,964,0002,400,256
8Apr 30, 2026 19:069,95343,680,58018,911,0005,972,0002,400,256
9Apr 30, 2026 19:069,96340,189,38520,923,0003,985,0002,396,160
10Apr 30, 2026 19:069,96445,099,06719,930,0004,982,0002,379,776
11Apr 30, 2026 19:069,96740,410,80219,728,0005,191,0002,392,064
12Sep 5, 2026 06:0710,07035,148,19522,054,0003,123,0002,113,536