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 03:38Elijah KinElijah KinScore: 4,987Success
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 03:404,89821,429,35810,010,0002,236,0002,113,536
2May 29, 2026 03:404,92422,427,12110,067,0002,243,0002,113,536
3May 29, 2026 03:404,93321,526,4279,221,0003,112,0002,113,536
4May 29, 2026 03:404,94321,727,8599,239,0003,119,0002,117,632
5May 29, 2026 03:404,98721,702,8509,188,0003,281,0002,113,536
6May 29, 2026 03:404,99821,679,6999,220,0003,276,0002,113,536
7May 29, 2026 03:405,01026,093,9259,444,0003,083,0002,117,632
8May 29, 2026 03:405,25822,329,92710,042,0003,105,0002,113,536
9May 29, 2026 03:405,30624,348,90710,041,0003,224,0002,113,536