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 16, 2026 18:50Andrew TsibinAndrew TsibinScore: 4,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 18:504,44120,795,04810,021,0001,082,0002,117,632
2Jul 16, 2026 18:504,45120,712,54810,046,0001,083,0002,117,632
3Jul 16, 2026 18:504,45820,640,93810,061,0001,084,0002,117,632
4Jul 16, 2026 18:504,46120,648,80010,071,0001,083,0002,117,632
5Jul 16, 2026 18:504,47120,782,14010,098,0001,081,0002,117,632
6Jul 16, 2026 18:504,48020,792,55210,114,0001,088,0002,117,632
7Jul 16, 2026 18:504,49120,828,71710,148,0001,081,0002,117,632
8Jul 16, 2026 18:504,49120,760,24310,145,0001,083,0002,117,632
9Jul 16, 2026 18:504,51920,925,99210,177,0001,122,0002,117,632