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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 13:092,82715,528,4095,041,0002,027,0002,113,536
2May 20, 2026 13:092,83015,486,2515,063,0002,012,0002,113,536
3May 20, 2026 13:092,83217,131,4195,064,0002,018,0002,113,536
4May 20, 2026 13:092,85614,936,3265,071,0002,071,0002,113,536
5May 20, 2026 13:092,86714,800,3955,152,0002,016,0002,113,536
6May 20, 2026 13:092,88516,779,4055,070,0002,143,0002,113,536
7May 20, 2026 13:092,89715,835,7815,227,0002,017,0002,113,536
8May 20, 2026 13:092,95015,170,4875,361,0002,016,0002,113,536
9May 20, 2026 13:092,98619,877,6615,372,0002,094,0002,113,536