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 9, 2026 03:03Elijah KinElijah KinScore: 2,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 03:042,07214,361,1033,950,0001,232,0002,117,632
2Jun 9, 2026 03:042,07414,398,7583,951,0001,235,0002,117,632
3Jun 9, 2026 03:042,10014,333,7203,998,0001,254,0002,117,632
4Jun 9, 2026 03:042,10314,341,8784,011,0001,247,0002,117,632
5Jun 9, 2026 03:042,22814,708,3734,330,0001,241,0002,117,632
6Jun 9, 2026 03:042,30214,882,0554,506,0001,250,0002,117,632
7Jun 9, 2026 03:042,32814,901,0004,555,0001,266,0002,117,632
8Jun 9, 2026 03:042,37115,020,8644,674,0001,255,0002,117,632
9Jun 9, 2026 03:042,37615,035,4454,674,0001,268,0002,117,632