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 02:43Victor MerckléVictor MerckléScore: 2,536Success
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 02:452,52414,606,8894,980,0001,330,0002,113,536
2May 30, 2026 02:452,52614,769,9794,988,0001,329,0002,113,536
3May 30, 2026 02:452,52914,816,1534,993,0001,330,0002,113,536
4May 30, 2026 02:452,53616,128,4925,006,0001,334,0002,113,536
5May 30, 2026 02:452,53615,387,9415,011,0001,329,0002,113,536
6May 30, 2026 02:452,59714,866,0705,127,0001,367,0002,113,536
7May 30, 2026 02:452,63117,288,3355,245,0001,333,0002,113,536
8May 30, 2026 02:452,66016,226,6335,306,0001,344,0002,113,536
9May 30, 2026 02:452,70116,418,5944,469,0002,285,0002,113,536