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 listMay 17, 2026 15:34Jacob McDanielJacob McDanielScore: 7,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:347,19227,187,84215,760,0002,221,0002,113,536
2May 17, 2026 15:347,20830,941,01715,794,0002,228,0002,113,536
3May 17, 2026 15:347,21327,698,78815,815,0002,218,0002,113,536
4May 17, 2026 15:347,23929,178,91615,845,0002,254,0002,113,536
5May 17, 2026 15:347,25828,276,86615,932,0002,215,0002,113,536
6May 17, 2026 15:347,29029,638,98915,994,0002,232,0002,113,536
7May 17, 2026 15:347,31527,404,01216,048,0002,240,0002,113,536
8May 17, 2026 15:347,33229,518,25816,079,0002,252,0002,113,536
9May 17, 2026 15:347,34430,426,71216,125,0002,236,0002,113,536