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 21:11Victor MerckléVictor MerckléScore: 2,433Success
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 21:132,42113,701,6284,836,0001,217,0002,113,536
2Jun 1, 2026 21:132,42113,692,5704,836,0001,217,0002,113,536
3Jun 1, 2026 21:132,42213,948,3284,836,0001,219,0002,113,536
4Jun 1, 2026 21:132,42913,793,4774,853,0001,221,0002,113,536
5Jun 1, 2026 21:132,43313,739,3964,862,0001,221,0002,113,536
6Jun 1, 2026 21:132,52513,977,5775,087,0001,226,0002,113,536
7Jun 1, 2026 21:132,54013,990,5165,127,0001,224,0002,113,536
8Jun 1, 2026 21:132,54114,380,8165,125,0001,229,0002,113,536
9Jun 1, 2026 21:132,54113,930,1095,129,0001,224,0002,113,536