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 19:14marko1597marko1597Score: 1,931Success
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 19:451,84413,065,0193,363,0001,247,0002,117,632
2Aug 14, 2026 19:451,86613,052,8893,391,0001,275,0002,117,632
3Aug 14, 2026 19:451,91512,935,8573,618,0001,171,0002,117,632
4Aug 14, 2026 19:451,92412,997,2773,617,0001,194,0002,117,632
5Aug 14, 2026 19:451,93113,197,0213,676,0001,152,0002,117,632
6Aug 14, 2026 19:451,95013,034,5073,729,0001,146,0002,117,632
7Aug 14, 2026 19:451,95113,100,2973,712,0001,167,0002,117,632
8Aug 14, 2026 19:451,95113,143,6293,720,0001,159,0002,117,632
9Aug 14, 2026 19:451,99013,383,0863,820,0001,156,0002,117,632