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 29, 2026 05:59Elijah KinElijah KinScore: 4,937Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 06:014,85821,628,1969,906,0002,241,0002,113,536
2May 29, 2026 06:014,87321,345,5669,944,0002,240,0002,113,536
3May 29, 2026 06:014,89621,535,4609,145,0003,097,0002,113,536
4May 29, 2026 06:014,89821,826,0119,976,0002,270,0002,113,536
5May 29, 2026 06:014,93724,691,6949,230,0003,113,0002,117,632
6May 29, 2026 06:014,98221,487,3809,224,0003,231,0002,113,536
7May 29, 2026 06:015,07822,134,4589,605,0003,091,0002,113,536
8May 29, 2026 06:015,19923,921,7679,782,0003,217,0002,113,536
9May 29, 2026 06:015,24422,439,8399,842,0003,268,0002,113,536