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 listApr 21, 2026 09:48Dominique GarmierDominique GarmierScore: 16,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 09:4916,35671,513,60538,898,0001,994,0002,408,448
2Apr 21, 2026 09:4916,36864,623,58333,936,0006,986,0002,306,048
3Apr 21, 2026 09:4916,38863,777,98736,973,0003,997,0002,506,752
4Apr 21, 2026 09:4916,39868,540,82834,996,0005,999,0002,256,896
5Apr 21, 2026 09:4916,43563,306,16235,076,0006,013,0002,256,896
6Apr 21, 2026 09:4916,46469,853,64933,129,0008,031,0002,252,800
7Apr 21, 2026 09:4916,50660,481,00537,241,0004,026,0002,256,896
8Apr 21, 2026 09:4916,60062,547,98638,465,0003,036,0002,252,800
9Apr 21, 2026 09:4916,63765,587,75037,536,0004,057,0002,510,848