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:55Tomislav TunkovicTomislav TunkovicScore: 1,526Success
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 01:581,43416,964,5513,587,0000524,288
2Aug 31, 2026 01:581,47914,411,5483,699,0000524,288
3Aug 31, 2026 01:581,49823,489,1262,617,0001,130,000524,288
4Aug 31, 2026 01:581,50312,038,5153,759,0000524,288
5Aug 31, 2026 01:581,52611,937,9703,816,0000524,288
6Aug 31, 2026 01:581,52711,918,1563,819,0000524,288
7Aug 31, 2026 01:581,53311,958,3263,833,0000524,288
8Aug 31, 2026 01:581,55434,356,6062,779,0001,108,000520,192
9Aug 31, 2026 01:581,56817,791,7812,785,0001,136,000524,288