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 listJul 20, 2025 05:45T PrathamT PrathamScore: 338,760Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2025 05:45338,733872,369,605844,833,0001,999,0002,285,568
2Jul 20, 2025 05:45338,736877,725,309843,841,0002,999,0002,285,568
3Jul 20, 2025 05:45338,749872,336,319841,874,0004,999,0002,289,664
4Jul 20, 2025 05:45338,750874,882,526843,877,0002,999,0002,289,664
5Jul 20, 2025 05:45338,760876,163,113842,902,0003,999,0002,412,544
6Jul 20, 2025 05:45338,800872,780,451842,007,0004,994,0002,289,664
7Jul 20, 2025 05:45338,831871,520,152843,083,0003,995,0002,273,280
8Jul 20, 2025 05:45339,150877,153,883845,877,0001,999,0002,441,216
9Jul 20, 2025 05:45339,400872,892,874845,499,0003,001,0002,285,568