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 listAug 27, 2026 17:56Elijah KinElijah KinScore: 2,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:572,12915,037,0224,216,0001,107,0002,117,632
2Aug 27, 2026 17:572,17815,168,9394,324,0001,123,0002,117,632
3Aug 27, 2026 17:572,34515,613,7094,600,0001,264,0002,117,632
4Aug 27, 2026 17:572,36915,674,6744,660,0001,264,0002,117,632
5Aug 27, 2026 17:572,39115,728,0994,683,0001,295,0002,117,632
6Aug 27, 2026 17:572,39716,545,0874,690,0001,303,0002,117,632
7Aug 27, 2026 17:572,40015,878,8294,900,0001,101,0002,117,632
8Aug 27, 2026 17:572,40315,711,2274,739,0001,269,0002,117,632
9Aug 27, 2026 17:572,44116,579,7844,733,0001,371,0002,117,632