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 16:33Victor MerckléVictor MerckléScore: 2,696Success
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 16:352,57715,406,8785,129,0001,314,0002,113,536
2May 29, 2026 16:352,59614,257,9675,167,0001,325,0002,113,536
3May 29, 2026 16:352,62715,280,0105,223,0001,346,0002,113,536
4May 29, 2026 16:352,69314,905,7615,426,0001,307,0002,113,536
5May 29, 2026 16:352,69615,015,4185,428,0001,312,0002,113,536
6May 29, 2026 16:352,69814,759,0645,436,0001,309,0002,113,536
7May 29, 2026 16:352,69915,532,6965,439,0001,309,0002,113,536
8May 29, 2026 16:352,70214,507,1735,447,0001,310,0002,113,536
9May 29, 2026 16:352,76815,980,4885,580,0001,340,0002,113,536