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 16, 2026 22:55Jacob McDanielJacob McDanielScore: 11,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:5811,68739,907,04722,830,0006,389,0002,113,536
2May 16, 2026 22:5811,70740,956,06222,905,0006,363,0002,113,536
3May 16, 2026 22:5811,72739,512,00722,891,0006,427,0002,113,536
4May 16, 2026 22:5811,74441,054,19422,834,0006,527,0002,113,536
5May 16, 2026 22:5811,81738,909,75222,774,0006,770,0002,113,536
6May 16, 2026 22:5811,81738,478,46222,847,0006,696,0002,113,536
7May 16, 2026 22:5811,97439,310,58023,080,0006,855,0002,113,536
8May 16, 2026 22:5812,38040,253,27124,261,0006,690,0002,113,536
9May 16, 2026 22:5812,57050,339,01824,849,0006,576,0002,113,536