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 21:17Victor MerckléVictor MerckléScore: 2,617Success
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 21:192,54315,753,1105,031,0001,328,0002,113,536
2May 29, 2026 21:192,54514,513,6935,033,0001,330,0002,113,536
3May 29, 2026 21:192,54614,271,2755,037,0001,329,0002,113,536
4May 29, 2026 21:192,57014,223,8825,086,0001,340,0002,113,536
5May 29, 2026 21:192,61716,418,3835,218,0001,326,0002,113,536
6May 29, 2026 21:192,62016,449,4865,226,0001,325,0002,113,536
7May 29, 2026 21:192,63016,423,6085,255,0001,322,0002,113,536
8May 29, 2026 21:192,63215,256,6955,254,0001,328,0002,113,536
9May 29, 2026 21:192,65814,234,5185,301,0001,344,0002,113,536