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 listJun 1, 2026 13:20Victor MerckléVictor MerckléScore: 2,596Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 13:212,50313,826,1084,935,0001,323,0002,113,536
2Jun 1, 2026 13:212,52313,824,2924,979,0001,330,0002,113,536
3Jun 1, 2026 13:212,53413,865,1825,004,0001,333,0002,113,536
4Jun 1, 2026 13:212,57913,941,3215,121,0001,328,0002,113,536
5Jun 1, 2026 13:212,59614,413,3385,167,0001,324,0002,113,536
6Jun 1, 2026 13:212,60514,339,3045,192,0001,322,0002,113,536
7Jun 1, 2026 13:212,61114,043,6015,206,0001,322,0002,113,536
8Jun 1, 2026 13:212,61314,046,7685,207,0001,326,0002,113,536
9Jun 1, 2026 13:212,61514,128,3575,217,0001,321,0002,113,536