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 31, 2026 01:57Tomislav TunkovicTomislav TunkovicScore: 2,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 02:042,07514,874,5243,920,0001,269,000548,864
2Aug 31, 2026 02:042,07514,839,5903,917,0001,271,000548,864
3Aug 31, 2026 02:042,08514,838,4373,953,0001,261,000548,864
4Aug 31, 2026 02:042,11514,899,4834,011,0001,278,000548,864
5Aug 31, 2026 02:042,12014,923,4524,027,0001,275,000548,864
6Aug 31, 2026 02:042,12115,002,5804,022,0001,282,000548,864
7Aug 31, 2026 02:042,12214,903,7294,029,0001,278,000548,864
8Aug 31, 2026 02:042,12214,974,9043,843,0001,463,000548,864
9Aug 31, 2026 02:042,22423,548,9684,276,0001,284,000548,864