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 15, 2026 01:15Elijah KinElijah KinScore: 22,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 01:1522,35084,862,51755,874,00002,314,240
2Mar 15, 2026 01:1522,35884,612,59953,899,0001,996,0002,412,544
3Mar 15, 2026 01:1522,36483,929,71652,916,0002,995,0002,265,088
4Mar 15, 2026 01:1522,40085,960,36854,000,0002,000,0002,265,088
5Mar 15, 2026 01:1522,47781,341,53152,180,0004,013,0002,265,088
6Mar 15, 2026 01:1522,61082,884,90153,498,0003,028,0002,314,240
7Mar 15, 2026 01:1522,61886,555,02454,526,0002,019,0002,265,088
8Mar 15, 2026 01:1522,62787,312,90951,518,0005,050,0002,310,144
9Mar 15, 2026 01:1522,63377,987,78153,552,0003,031,0002,265,088