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 14, 2026 00:32Andrew EpsteinAndrew EpsteinScore: 1,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 00:331,26811,706,0673,170,0000524,288
2Sep 14, 2026 00:331,36611,780,3723,416,0000524,288
3Sep 14, 2026 00:331,37211,954,9253,432,0000524,288
4Sep 14, 2026 00:331,38011,802,5763,450,0000524,288
5Sep 14, 2026 00:331,38412,000,9683,462,0000524,288
6Sep 14, 2026 00:331,38612,008,7153,467,0000524,288
7Sep 14, 2026 00:331,39212,173,8533,481,0000524,288
8Sep 14, 2026 00:331,39611,770,4203,492,0000524,288
9Sep 14, 2026 00:331,40212,080,6813,507,0000524,288