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 listJun 9, 2026 03:00Elijah KinElijah KinScore: 2,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 03:012,07214,288,2403,963,0001,219,0002,117,632
2Jun 9, 2026 03:012,07914,243,0733,966,0001,233,0002,117,632
3Jun 9, 2026 03:012,09417,240,0803,990,0001,247,0002,117,632
4Jun 9, 2026 03:012,10114,353,0283,998,0001,255,0002,117,632
5Jun 9, 2026 03:012,29714,772,9654,494,0001,250,0002,117,632
6Jun 9, 2026 03:012,39015,126,8304,723,0001,252,0002,117,632
7Jun 9, 2026 03:012,40815,037,2854,766,0001,254,0002,117,632
8Jun 9, 2026 03:012,41515,095,1264,802,0001,236,0002,117,632
9Jun 9, 2026 03:012,43415,245,7034,995,0001,092,0002,117,632