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 15, 2026 22:50marko1597marko1597Score: 1,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:141,56612,357,2152,687,0001,229,0002,113,536
2Aug 15, 2026 23:141,57012,388,6822,758,0001,167,0002,113,536
3Aug 15, 2026 23:141,58712,249,4982,777,0001,191,0002,113,536
4Aug 15, 2026 23:141,59612,356,9132,799,0001,191,0002,113,536
5Aug 15, 2026 23:141,70113,476,0363,043,0001,211,0002,113,536
6Aug 15, 2026 23:141,71812,672,9493,130,0001,167,0002,113,536
7Aug 15, 2026 23:141,72212,653,5333,080,0001,227,0002,113,536
8Aug 15, 2026 23:141,72613,363,8733,093,0001,224,0002,113,536
9Aug 15, 2026 23:141,77012,824,1643,278,0001,148,0002,113,536