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 listAug 15, 2026 10:41Tomislav TunkovicTomislav TunkovicScore: 2,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 10:422,04613,573,4034,056,0001,061,0002,117,632
2Aug 15, 2026 10:422,05013,513,6564,064,0001,061,0002,117,632
3Aug 15, 2026 10:422,05813,568,5884,080,0001,067,0002,117,632
4Aug 15, 2026 10:422,06613,677,1114,099,0001,066,0002,117,632
5Aug 15, 2026 10:422,08013,625,4374,134,0001,068,0002,117,632
6Aug 15, 2026 10:422,12613,654,6394,054,0001,262,0002,117,632
7Aug 15, 2026 10:422,23813,966,9004,516,0001,079,0002,117,632
8Aug 15, 2026 10:422,36514,300,5144,844,0001,070,0002,117,632
9Aug 15, 2026 10:422,40414,378,2504,917,0001,094,0002,117,632