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 22, 2026 13:07M-RochatM-RochatScore: 4,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 13:074,25319,887,3129,369,0001,265,0002,113,536
2May 22, 2026 13:074,26219,870,8799,363,0001,293,0002,113,536
3May 22, 2026 13:074,29419,996,3549,365,0001,370,0002,121,728
4May 22, 2026 13:074,30219,953,4149,384,0001,371,0002,113,536
5May 22, 2026 13:074,30220,013,3459,375,0001,380,0002,113,536
6May 22, 2026 13:074,31020,000,0059,712,0001,064,0002,113,536
7May 22, 2026 13:074,31420,021,8199,723,0001,064,0002,113,536
8May 22, 2026 13:074,31619,998,6749,728,0001,062,0002,113,536
9May 22, 2026 13:074,32020,165,6499,432,0001,368,0002,113,536