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 listApr 13, 2026 15:25limanjun99limanjun99Score: 3,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 15:252,99823,213,8065,353,0002,141,0002,281,472
2Apr 13, 2026 15:253,00524,689,8935,366,0002,146,0002,293,760
3Apr 13, 2026 15:253,01227,666,8586,454,0001,075,0002,273,280
4Apr 13, 2026 15:253,01824,676,3995,389,0002,155,0002,293,760
5Apr 13, 2026 15:253,02723,343,6645,405,0002,162,0002,293,760
6Apr 13, 2026 15:253,02724,428,0715,406,0002,162,0002,293,760
7Apr 13, 2026 15:253,05428,544,0445,454,0002,181,0002,293,760
8Apr 13, 2026 15:253,08123,209,1785,502,0002,200,0002,293,760
9Apr 13, 2026 15:253,16629,949,1454,947,0002,968,0002,527,232