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 30, 2026 21:23Andrew TsibinAndrew TsibinScore: 2,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 21:242,55716,451,0525,017,0001,377,0002,117,632
2Jul 30, 2026 21:242,56016,371,0085,019,0001,381,0002,117,632
3Jul 30, 2026 21:242,56817,659,6385,030,0001,391,0002,117,632
4Jul 30, 2026 21:242,57016,368,3725,042,0001,385,0002,117,632
5Jul 30, 2026 21:242,58216,439,8895,058,0001,398,0002,117,632
6Jul 30, 2026 21:242,60716,461,1355,079,0001,439,0002,117,632
7Jul 30, 2026 21:242,60816,532,7055,089,0001,433,0002,117,632
8Jul 30, 2026 21:242,61416,546,7975,113,0001,423,0002,117,632
9Jul 30, 2026 21:242,63416,546,2465,133,0001,454,0002,117,632