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 listSep 26, 2026 18:13Kevin HeaveyKevin HeaveyScore: 1,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 18:131,15811,492,4582,895,0000524,288
2Sep 26, 2026 18:131,25612,393,5203,142,0000524,288
3Sep 26, 2026 18:131,25712,340,4923,144,0000524,288
4Sep 26, 2026 18:131,25712,327,7003,143,0000524,288
5Sep 26, 2026 18:131,26011,819,3103,150,0000524,288
6Sep 26, 2026 18:131,26212,303,6513,155,0000524,288
7Sep 26, 2026 18:131,26612,288,2943,167,0000524,288
8Sep 26, 2026 18:131,26612,344,8403,167,0000524,288
9Sep 26, 2026 18:131,26711,784,8383,169,0000524,288