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 03:20Victor MerckléVictor MerckléScore: 2,539Success
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 03:222,51814,112,9804,969,0001,328,0002,113,536
2May 30, 2026 03:222,52316,352,2564,978,0001,330,0002,113,536
3May 30, 2026 03:222,52514,228,9084,981,0001,333,0002,113,536
4May 30, 2026 03:222,53413,930,3835,002,0001,334,0002,113,536
5May 30, 2026 03:222,53914,511,7245,013,0001,336,0002,113,536
6May 30, 2026 03:222,54517,721,5485,026,0001,337,0002,113,536
7May 30, 2026 03:222,54916,857,1785,026,0001,348,0002,113,536
8May 30, 2026 03:222,55715,029,7315,043,0001,351,0002,113,536
9May 30, 2026 03:222,65014,347,6484,360,0002,267,0002,113,536