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 29, 2026 22:05Victor MerckléVictor MerckléScore: 2,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 22:062,52814,271,7594,995,0001,326,0002,113,536
2May 29, 2026 22:062,53014,270,4454,996,0001,330,0002,113,536
3May 29, 2026 22:062,53115,827,4494,998,0001,331,0002,113,536
4May 29, 2026 22:062,53216,010,8124,996,0001,334,0002,113,536
5May 29, 2026 22:062,53814,357,2095,009,0001,336,0002,113,536
6May 29, 2026 22:062,53914,109,9885,017,0001,332,0002,113,536
7May 29, 2026 22:062,54316,250,7905,025,0001,333,0002,113,536
8May 29, 2026 22:062,54414,108,0175,024,0001,337,0002,113,536
9May 29, 2026 22:062,56014,869,9185,056,0001,346,0002,113,536