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 19, 2026 08:34Elijah KinElijah KinScore: 16,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:3416,15051,379,82738,287,0002,088,0002,113,536
2May 19, 2026 08:3416,17349,633,23038,343,0002,090,0002,113,536
3May 19, 2026 08:3416,19052,539,54938,384,0002,092,0002,113,536
4May 19, 2026 08:3416,19151,639,66038,393,0002,086,0002,113,536
5May 19, 2026 08:3416,20851,934,00238,432,0002,088,0002,113,536
6May 19, 2026 08:3416,22049,669,11638,462,0002,088,0002,113,536
7May 19, 2026 08:3416,22849,864,08938,479,0002,091,0002,113,536
8May 19, 2026 08:3416,27556,038,30538,596,0002,092,0002,113,536
9May 19, 2026 08:3416,31951,290,32638,711,0002,087,0002,113,536