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 04:19Victor MerckléVictor MerckléScore: 2,614Success
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 04:212,52815,985,5184,985,0001,335,0002,113,536
2May 30, 2026 04:212,54415,047,7105,022,0001,338,0002,113,536
3May 30, 2026 04:212,60014,330,7065,127,0001,373,0002,113,536
4May 30, 2026 04:212,60115,197,0154,230,0002,274,0002,113,536
5May 30, 2026 04:212,61414,345,2425,207,0001,329,0002,113,536
6May 30, 2026 04:212,61514,311,9065,167,0001,371,0002,113,536
7May 30, 2026 04:212,62616,528,7105,234,0001,331,0002,113,536
8May 30, 2026 04:212,62614,187,4325,234,0001,332,0002,113,536
9May 30, 2026 04:212,63415,573,8265,253,0001,332,0002,113,536