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 30, 2026 02:15Elijah KinElijah KinScore: 10,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 02:1710,42439,301,35822,934,0003,127,0002,117,632
2May 30, 2026 02:1710,42736,054,98422,944,0003,125,0002,117,632
3May 30, 2026 02:1710,56350,499,58323,150,0003,259,0002,117,632
4May 30, 2026 02:1710,56836,770,57623,046,0003,375,0002,117,632
5May 30, 2026 02:1710,57435,677,70223,297,0003,139,0002,117,632
6May 30, 2026 02:1710,60135,778,72823,377,0003,126,0002,117,632
7May 30, 2026 02:1710,65135,863,40323,495,0003,133,0002,117,632
8May 30, 2026 02:1710,80236,937,69922,954,0004,053,0002,117,632
9May 30, 2026 02:1710,93036,512,36323,947,0003,379,0002,117,632