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 29, 2026 22:58Victor MerckléVictor MerckléScore: 2,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2026 23:002,52914,621,5264,994,0001,329,0002,113,536
2May 29, 2026 23:002,53015,333,1164,997,0001,328,0002,113,536
3May 29, 2026 23:002,53015,043,0294,996,0001,330,0002,113,536
4May 29, 2026 23:002,53415,116,4625,005,0001,330,0002,113,536
5May 29, 2026 23:002,54816,110,4185,038,0001,332,0002,113,536
6May 29, 2026 23:002,55214,721,4675,035,0001,345,0002,113,536
7May 29, 2026 23:002,55414,685,8695,042,0001,343,0002,113,536
8May 29, 2026 23:002,61814,856,0855,219,0001,327,0002,113,536
9May 29, 2026 23:002,65217,379,1005,288,0001,343,0002,113,536