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 30, 2026 04:11Victor MerckléVictor MerckléScore: 2,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 30, 2026 04:132,52315,876,7964,973,0001,335,0002,113,536
2May 30, 2026 04:132,52513,956,6184,981,0001,332,0002,113,536
3May 30, 2026 04:132,52616,273,0454,982,0001,333,0002,113,536
4May 30, 2026 04:132,53613,989,6905,007,0001,333,0002,113,536
5May 30, 2026 04:132,56016,005,4745,050,0001,352,0002,113,536
6May 30, 2026 04:132,62514,154,1935,231,0001,332,0002,113,536
7May 30, 2026 04:132,64816,251,7615,274,0001,346,0002,113,536
8May 30, 2026 04:132,68116,634,6144,422,0002,282,0002,113,536
9May 30, 2026 04:132,68820,471,4425,376,0001,345,0002,113,536