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 05:15Victor MerckléVictor MerckléScore: 2,745Success
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 05:172,68514,519,6665,407,0001,307,0002,113,536
2May 30, 2026 05:172,68614,906,8495,408,0001,309,0002,113,536
3May 30, 2026 05:172,68716,265,0625,409,0001,310,0002,113,536
4May 30, 2026 05:172,71916,516,8195,472,0001,326,0002,113,536
5May 30, 2026 05:172,74516,071,9925,551,0001,312,0002,113,536
6May 30, 2026 05:172,74716,496,9235,527,0001,341,0002,113,536
7May 30, 2026 05:172,76714,980,6994,662,0002,256,0002,113,536
8May 30, 2026 05:172,79014,717,6295,665,0001,312,0002,113,536
9May 30, 2026 05:172,80516,953,0715,700,0001,314,0002,113,536