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 01:42Victor MerckléVictor MerckléScore: 2,562Success
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 01:432,54414,911,0915,036,0001,325,0002,113,536
2May 30, 2026 01:432,54514,213,6085,038,0001,326,0002,113,536
3May 30, 2026 01:432,55414,192,5795,056,0001,329,0002,113,536
4May 30, 2026 01:432,55916,747,2445,067,0001,331,0002,113,536
5May 30, 2026 01:432,56214,795,4885,078,0001,327,0002,113,536
6May 30, 2026 01:432,57314,184,5845,092,0001,342,0002,113,536
7May 30, 2026 01:432,59917,194,1245,176,0001,323,0002,113,536
8May 30, 2026 01:432,63014,313,7085,250,0001,327,0002,113,536
9May 30, 2026 01:432,64414,442,0815,284,0001,328,0002,113,536