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 09:23limanjun99limanjun99Score: 3,107Success
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 09:233,01024,580,1656,450,0001,075,0002,523,136
2Apr 13, 2026 09:233,01027,782,7495,375,0002,150,0002,527,232
3Apr 13, 2026 09:233,02825,481,6655,407,0002,162,0002,506,752
4Apr 13, 2026 09:233,04423,481,7736,524,0001,087,0002,273,280
5Apr 13, 2026 09:233,10728,518,5185,548,0002,219,0002,293,760
6Apr 13, 2026 09:233,16525,148,8444,945,0002,967,0002,293,760
7Apr 13, 2026 09:233,16829,865,1975,940,0001,980,0002,293,760
8Apr 13, 2026 09:233,16828,955,4505,940,0001,980,0002,293,760
9Apr 13, 2026 09:233,21036,164,9846,018,0002,006,0002,293,760