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 listJun 3, 2026 23:18Elijah KinElijah KinScore: 3,066Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 23:213,03316,663,6206,413,0001,170,0002,117,632
2Jun 3, 2026 23:213,03816,677,6456,429,0001,168,0002,117,632
3Jun 3, 2026 23:213,04916,618,5106,453,0001,171,0002,117,632
4Jun 3, 2026 23:213,05116,726,9466,457,0001,171,0002,117,632
5Jun 3, 2026 23:213,06618,625,5156,470,0001,196,0002,117,632
6Jun 3, 2026 23:213,07216,754,6056,507,0001,174,0002,117,632
7Jun 3, 2026 23:213,14316,937,5166,741,0001,118,0002,117,632
8Jun 3, 2026 23:213,15217,366,3636,686,0001,195,0002,117,632
9Jun 3, 2026 23:213,21417,253,6956,914,0001,122,0002,117,632