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 listMay 18, 2026 08:04Jacob McDanielJacob McDanielScore: 2,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 08:122,76817,998,6275,718,0001,204,0002,121,728
2May 18, 2026 08:122,85418,071,2225,865,0001,270,0002,121,728
3May 18, 2026 08:122,87616,634,6015,936,0001,254,0002,121,728
4May 18, 2026 08:122,87917,364,1675,937,0001,261,0002,121,728
5May 18, 2026 08:122,91921,118,0486,034,0001,264,0002,121,728
6May 18, 2026 08:122,93319,508,4916,040,0001,294,0002,121,728
7May 18, 2026 08:122,93817,133,3096,055,0001,290,0002,121,728
8May 18, 2026 08:122,94018,490,6196,080,0001,271,0002,121,728
9May 18, 2026 08:122,95217,070,0666,121,0001,260,0002,121,728