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 listMay 22, 2026 09:48M-RochatM-RochatScore: 4,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:484,54820,702,97110,284,0001,087,0002,117,632
2May 22, 2026 09:484,55120,643,96910,289,0001,089,0002,121,728
3May 22, 2026 09:484,56620,727,23410,326,0001,089,0002,121,728
4May 22, 2026 09:484,67720,896,80010,596,0001,098,0002,121,728
5May 22, 2026 09:484,68220,937,54710,607,0001,100,0002,117,632
6May 22, 2026 09:484,68821,543,13210,621,0001,100,0002,117,632
7May 22, 2026 09:484,69821,737,19310,645,0001,100,0002,117,632
8May 22, 2026 09:484,70721,586,96010,668,0001,100,0002,117,632
9May 22, 2026 09:484,71923,108,33310,697,0001,101,0002,117,632