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 listApr 12, 2026 15:10limanjun99limanjun99Score: 28,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 15:1028,09091,686,18255,177,00015,048,000802,816
2Apr 12, 2026 15:1028,19298,120,03047,322,00023,157,000872,448
3Apr 12, 2026 15:1028,25096,576,78251,455,00019,169,000761,856
4Apr 12, 2026 15:1028,260105,670,13454,502,00016,148,000811,008
5Apr 12, 2026 15:1028,54099,513,54154,267,00017,084,000876,544
6Apr 12, 2026 15:1028,57496,389,73352,318,00019,116,000745,472
7Apr 12, 2026 15:1028,64295,886,64855,470,00016,136,000770,048
8Apr 12, 2026 15:1028,71697,438,48949,855,00021,936,000884,736
9Apr 12, 2026 15:1028,72397,180,96554,853,00016,954,000811,008