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 11:31Victor MerckléVictor MerckléScore: 2,650Success
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 11:322,60815,893,5745,180,0001,340,0002,113,536
2May 29, 2026 11:322,62616,067,3815,220,0001,345,0002,113,536
3May 29, 2026 11:322,63314,355,4785,238,0001,346,0002,113,536
4May 29, 2026 11:322,63615,854,3075,247,0001,345,0002,113,536
5May 29, 2026 11:322,65016,239,8425,282,0001,344,0002,113,536
6May 29, 2026 11:322,66815,683,1875,307,0001,364,0002,113,536
7May 29, 2026 11:322,77016,123,2985,585,0001,342,0002,113,536
8May 29, 2026 11:322,81314,799,2684,692,0002,341,0002,113,536
9May 29, 2026 11:322,81415,464,7754,732,0002,305,0002,113,536