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 listMay 20, 2026 08:07Jacob McDanielJacob McDanielScore: 2,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 08:072,92618,441,1726,137,0001,179,0002,117,632
2May 20, 2026 08:072,93419,377,7416,159,0001,178,0002,117,632
3May 20, 2026 08:072,93818,614,8276,167,0001,179,0002,117,632
4May 20, 2026 08:072,94417,551,8836,161,0001,199,0002,117,632
5May 20, 2026 08:072,94417,313,1586,230,0001,131,0002,117,632
6May 20, 2026 08:073,00218,087,3796,258,0001,248,0002,117,632
7May 20, 2026 08:073,00518,501,9616,270,0001,243,0002,117,632
8May 20, 2026 08:073,04017,930,6486,337,0001,265,0002,117,632
9May 20, 2026 08:073,08018,944,9086,435,0001,266,0002,117,632