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 8, 2026 17:44Elijah KinElijah KinScore: 2,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 17:462,18714,578,0634,237,0001,231,0002,117,632
2Jun 8, 2026 17:462,20614,656,9014,270,0001,246,0002,117,632
3Jun 8, 2026 17:462,43615,275,9014,845,0001,246,0002,117,632
4Jun 8, 2026 17:462,47215,213,6224,939,0001,242,0002,117,632
5Jun 8, 2026 17:462,48915,281,9324,704,0001,520,0002,117,632
6Jun 8, 2026 17:462,50315,378,2865,018,0001,241,0002,117,632
7Jun 8, 2026 17:462,53515,423,2705,116,0001,222,0002,117,632
8Jun 8, 2026 17:462,54315,466,4505,122,0001,237,0002,117,632
9Jun 8, 2026 17:462,56215,944,7685,155,0001,252,0002,117,632