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 listAug 27, 2026 18:24Elijah KinElijah KinScore: 2,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 18:252,33615,613,3894,298,0001,542,0002,117,632
2Aug 27, 2026 18:252,42816,535,5264,294,0001,778,0002,117,632
3Aug 27, 2026 18:252,47815,965,1754,643,0001,554,0002,117,632
4Aug 27, 2026 18:252,51516,511,2904,780,0001,509,0002,117,632
5Aug 27, 2026 18:252,57816,230,9734,902,0001,545,0002,117,632
6Aug 27, 2026 18:252,70617,000,0015,249,0001,518,0002,117,632
7Aug 27, 2026 18:252,71316,556,8175,258,0001,526,0002,117,632
8Aug 27, 2026 18:252,71817,089,7935,279,0001,517,0002,117,632
9Aug 27, 2026 18:252,77417,851,9685,435,0001,501,0002,117,632