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 3, 2026 17:24Elijah KinElijah KinScore: 2,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 17:252,83516,099,8835,993,0001,096,0002,117,632
2Jun 3, 2026 17:252,83716,117,4665,990,0001,103,0002,117,632
3Jun 3, 2026 17:252,86816,270,6776,034,0001,136,0002,117,632
4Jun 3, 2026 17:252,87116,191,9026,063,0001,116,0002,117,632
5Jun 3, 2026 17:252,88416,202,7686,080,0001,130,0002,117,632
6Jun 3, 2026 17:252,89017,503,6796,088,0001,139,0002,117,632
7Jun 3, 2026 17:252,93918,710,7896,199,0001,149,0002,117,632
8Jun 3, 2026 17:252,98916,506,6736,305,0001,168,0002,117,632
9Jun 3, 2026 17:253,03018,724,1386,400,0001,176,0002,117,632