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 07:53Victor MerckléVictor MerckléScore: 2,616Success
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 07:552,52514,100,5494,981,0001,333,0002,113,536
2May 30, 2026 07:552,52716,715,3484,985,0001,333,0002,113,536
3May 30, 2026 07:552,55115,529,5125,040,0001,339,0002,113,536
4May 30, 2026 07:552,56615,049,4975,060,0001,355,0002,113,536
5May 30, 2026 07:552,61616,480,2715,213,0001,329,0002,113,536
6May 30, 2026 07:552,61815,913,1575,214,0001,333,0002,113,536
7May 30, 2026 07:552,62614,286,2175,235,0001,330,0002,113,536
8May 30, 2026 07:552,66216,031,9525,309,0001,347,0002,113,536
9May 30, 2026 07:552,69814,483,0664,467,0002,280,0002,113,536