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:14M-RochatM-RochatScore: 4,483Success
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:144,35819,613,0389,811,0001,085,0002,121,728
2May 16, 2026 23:144,36219,623,1829,824,0001,081,0002,117,632
3May 16, 2026 23:144,37419,668,6909,850,0001,086,0002,117,632
4May 16, 2026 23:144,43719,832,03710,001,0001,092,0002,113,536
5May 16, 2026 23:144,48319,865,75110,117,0001,091,0002,117,632
6May 16, 2026 23:144,48519,974,88110,121,0001,092,0002,113,536
7May 16, 2026 23:144,49019,924,47710,132,0001,093,0002,113,536
8May 16, 2026 23:144,49619,915,61110,149,0001,092,0002,117,632
9May 16, 2026 23:144,49919,922,74110,154,0001,095,0002,117,632