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,492Success
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,48019,912,08610,109,0001,093,0002,117,632
2May 16, 2026 23:134,48219,917,17610,116,0001,091,0002,117,632
3May 16, 2026 23:134,48719,943,25610,125,0001,093,0002,117,632
4May 16, 2026 23:134,49019,972,76310,132,0001,093,0002,113,536
5May 16, 2026 23:134,49219,956,75010,137,0001,093,0002,117,632
6May 16, 2026 23:134,49319,924,35210,139,0001,094,0002,113,536
7May 16, 2026 23:134,49319,848,49110,140,0001,093,0002,117,632
8May 16, 2026 23:134,49419,905,89810,143,0001,094,0002,113,536
9May 16, 2026 23:134,49519,936,24910,145,0001,094,0002,113,536