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 listAug 14, 2026 18:03marko1597marko1597Score: 1,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:041,75712,814,6683,180,0001,214,0002,117,632
2Aug 14, 2026 18:041,76012,732,5663,145,0001,257,0002,117,632
3Aug 14, 2026 18:041,76512,640,6283,184,0001,229,0002,117,632
4Aug 14, 2026 18:041,76512,626,5783,166,0001,248,0002,117,632
5Aug 14, 2026 18:041,77012,861,0353,186,0001,240,0002,117,632
6Aug 14, 2026 18:041,77112,884,2713,192,0001,237,0002,117,632
7Aug 14, 2026 18:041,81012,830,2133,239,0001,286,0002,117,632
8Aug 14, 2026 18:041,84213,116,1853,367,0001,239,0002,117,632
9Aug 14, 2026 18:041,89013,282,4243,428,0001,299,0002,117,632