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 30, 2026 23:28Tomislav TunkovicTomislav TunkovicScore: 1,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:291,39711,828,2613,494,0000524,288
2Aug 30, 2026 23:291,46712,014,5123,668,0000524,288
3Aug 30, 2026 23:291,51512,182,6393,788,0000524,288
4Aug 30, 2026 23:291,54412,178,5893,862,0000524,288
5Aug 30, 2026 23:291,54512,233,5473,864,0000524,288
6Aug 30, 2026 23:291,54612,197,0663,867,0000524,288
7Aug 30, 2026 23:291,54612,260,6113,867,0000524,288
8Aug 30, 2026 23:291,54812,210,1273,871,0000524,288
9Aug 30, 2026 23:291,55312,048,0853,883,0000524,288