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 listMar 14, 2026 22:53Elijah KinElijah KinScore: 492,412Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:53492,0871,260,087,6351,227,219,0002,998,0002,301,952
2Mar 14, 2026 22:53492,1321,256,619,0531,228,333,0001,998,0002,301,952
3Mar 14, 2026 22:53492,3151,258,337,3111,229,789,000999,0002,301,952
4Mar 14, 2026 22:53492,3431,259,615,5141,229,858,000999,0002,314,240
5Mar 14, 2026 22:53492,4121,251,462,5881,230,029,0001,000,0002,301,952
6Mar 14, 2026 22:53492,5111,260,759,0671,229,279,0001,998,0002,301,952
7Mar 14, 2026 22:53492,5821,256,082,9781,229,456,0001,999,0002,301,952
8Mar 14, 2026 22:53492,6261,254,502,6171,229,565,0001,999,0002,437,120
9Mar 14, 2026 22:53492,8451,262,423,5161,231,114,000999,0002,314,240