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 listJul 17, 2026 19:08Elijah KinElijah KinScore: 2,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 19:111,96114,597,2163,632,0001,271,0002,117,632
2Jul 17, 2026 19:111,99140,808,9993,671,0001,308,0002,117,632
3Jul 17, 2026 19:112,05132,404,1274,002,0001,126,0002,117,632
4Jul 17, 2026 19:112,08914,810,6653,951,0001,273,0002,117,632
5Jul 17, 2026 19:112,20215,120,2734,260,0001,245,0002,117,632
6Jul 17, 2026 19:112,21651,551,6154,256,0001,285,0002,117,632
7Jul 17, 2026 19:112,21815,344,8104,292,0001,253,0002,117,632
8Jul 17, 2026 19:112,23343,490,9594,315,0001,268,0002,117,632
9Jul 17, 2026 19:112,25815,216,8654,505,0001,142,0002,117,632