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 00:16Victor MerckléVictor MerckléScore: 2,559Success
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 00:172,52215,365,6884,973,0001,334,0002,113,536
2May 30, 2026 00:172,53315,553,0724,999,0001,334,0002,113,536
3May 30, 2026 00:172,53415,003,8644,999,0001,337,0002,113,536
4May 30, 2026 00:172,54215,892,0425,024,0001,333,0002,113,536
5May 30, 2026 00:172,55917,200,9825,046,0001,353,0002,113,536
6May 30, 2026 00:172,61214,230,8615,203,0001,327,0002,113,536
7May 30, 2026 00:172,62117,435,1135,220,0001,334,0002,113,536
8May 30, 2026 00:172,65614,343,6265,289,0001,352,0002,113,536
9May 30, 2026 00:172,69016,168,1044,449,0002,276,0002,113,536