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 20, 2026 17:40Jacob McDanielJacob McDanielScore: 2,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:402,50817,495,4085,075,0001,197,0002,117,632
2May 20, 2026 17:402,51218,736,5805,146,0001,134,0002,117,632
3May 20, 2026 17:402,52925,065,7385,108,0001,215,0002,113,536
4May 20, 2026 17:402,53018,522,6195,125,0001,201,0002,117,632
5May 20, 2026 17:402,53217,138,3105,127,0001,203,0002,117,632
6May 20, 2026 17:402,53416,958,0445,125,0001,211,0002,117,632
7May 20, 2026 17:402,55116,102,8655,151,0001,227,0002,117,632
8May 20, 2026 17:402,57016,592,0335,191,0001,236,0002,117,632
9May 20, 2026 17:402,59916,962,8445,226,0001,272,0002,117,632