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 04:43Victor MerckléVictor MerckléScore: 2,553Success
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 04:452,52014,067,3904,968,0001,332,0002,113,536
2May 30, 2026 04:452,52516,127,8144,980,0001,334,0002,113,536
3May 30, 2026 04:452,53814,066,4025,009,0001,337,0002,113,536
4May 30, 2026 04:452,54714,161,8385,029,0001,339,0002,113,536
5May 30, 2026 04:452,55314,256,0125,033,0001,350,0002,113,536
6May 30, 2026 04:452,58814,428,1405,105,0001,366,0002,113,536
7May 30, 2026 04:452,61214,278,7355,205,0001,327,0002,113,536
8May 30, 2026 04:452,62414,292,3825,232,0001,329,0002,113,536
9May 30, 2026 04:452,62814,406,6605,234,0001,336,0002,113,536