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 17, 2026 15:33Jacob McDanielJacob McDanielScore: 7,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:337,25327,884,05115,883,0002,251,0002,113,536
2May 17, 2026 15:337,26129,190,97315,916,0002,237,0002,113,536
3May 17, 2026 15:337,28128,306,80015,973,0002,230,0002,113,536
4May 17, 2026 15:337,33730,653,63316,079,0002,265,0002,113,536
5May 17, 2026 15:337,35228,587,28316,151,0002,230,0002,113,536
6May 17, 2026 15:337,36029,584,85716,179,0002,223,0002,113,536
7May 17, 2026 15:337,36231,014,74516,141,0002,265,0002,113,536
8May 17, 2026 15:337,39528,286,71316,213,0002,275,0002,113,536
9May 17, 2026 15:337,48627,883,85416,434,0002,281,0002,113,536