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 12:30Victor 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
1May 30, 2026 12:322,53316,312,5964,979,0001,355,0002,113,536
2May 30, 2026 12:322,55616,382,6185,028,0001,362,0002,113,536
3May 30, 2026 12:322,56414,275,0355,037,0001,374,0002,113,536
4May 30, 2026 12:322,57014,243,4355,052,0001,375,0002,113,536
5May 30, 2026 12:322,59614,565,4545,137,0001,355,0002,113,536
6May 30, 2026 12:322,60114,929,5995,113,0001,391,0002,113,536
7May 30, 2026 12:322,63615,776,7155,235,0001,356,0002,113,536
8May 30, 2026 12:322,64215,999,1105,249,0001,357,0002,113,536
9May 30, 2026 12:322,65417,829,8095,271,0001,364,0002,113,536