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,500Success
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,49319,725,42910,139,0001,094,0002,117,632
2May 16, 2026 23:134,49519,986,55210,142,0001,096,0002,117,632
3May 16, 2026 23:134,49719,962,57310,151,0001,092,0002,117,632
4May 16, 2026 23:134,49719,826,85310,153,0001,090,0002,121,728
5May 16, 2026 23:134,50021,802,75210,159,0001,092,0002,117,632
6May 16, 2026 23:134,50020,193,53810,153,0001,097,0002,117,632
7May 16, 2026 23:134,50519,891,98810,169,0001,094,0002,121,728
8May 16, 2026 23:134,51520,086,41310,192,0001,096,0002,117,632
9May 16, 2026 23:134,51519,786,57010,193,0001,096,0002,121,728