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 17, 2026 17:45Jacob McDanielJacob McDanielScore: 3,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 17:463,62619,225,1706,840,0002,226,0002,121,728
2May 17, 2026 17:463,63820,516,0636,888,0002,208,0002,113,536
3May 17, 2026 17:463,64418,284,2066,872,0002,240,0002,121,728
4May 17, 2026 17:463,64720,158,8846,886,0002,233,0002,121,728
5May 17, 2026 17:463,66320,652,3506,906,0002,252,0002,121,728
6May 17, 2026 17:463,67520,328,9726,926,0002,262,0002,121,728
7May 17, 2026 17:463,70621,387,2026,899,0002,368,0002,121,728
8May 17, 2026 17:463,91020,837,7467,466,0002,309,0002,117,632
9May 17, 2026 17:463,96020,524,2367,563,0002,338,0002,121,728