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 10:55Victor 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 10:572,50913,752,3334,948,0001,326,0002,113,536
2Jun 1, 2026 10:572,53513,779,6154,997,0001,341,0002,113,536
3Jun 1, 2026 10:572,54113,962,1215,016,0001,338,0002,113,536
4Jun 1, 2026 10:572,55013,968,3145,031,0001,344,0002,113,536
5Jun 1, 2026 10:572,59614,042,7125,172,0001,319,0002,113,536
6Jun 1, 2026 10:572,60914,065,3595,201,0001,322,0002,113,536
7Jun 1, 2026 10:572,61114,016,5775,207,0001,322,0002,113,536
8Jun 1, 2026 10:572,61414,065,0835,214,0001,321,0002,113,536
9Jun 1, 2026 10:572,61514,078,6155,214,0001,324,0002,113,536