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 16, 2026 23:12M-RochatM-RochatScore: 4,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 23:134,36119,544,4049,822,0001,082,0002,121,728
2May 16, 2026 23:134,36822,195,5269,838,0001,082,0002,117,632
3May 16, 2026 23:134,43819,833,16310,011,0001,084,0002,117,632
4May 16, 2026 23:134,45219,844,83210,046,0001,084,0002,117,632
5May 16, 2026 23:134,49619,871,30610,149,0001,091,0002,117,632
6May 16, 2026 23:134,51420,799,32210,189,0001,096,0002,121,728
7May 16, 2026 23:134,52419,991,42210,213,0001,097,0002,117,632
8May 16, 2026 23:134,52419,877,20210,215,0001,097,0002,117,632
9May 16, 2026 23:134,53520,073,96610,242,0001,096,0002,117,632