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 07:25Victor MerckléVictor MerckléScore: 2,638Success
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 07:272,52414,000,0484,978,0001,334,0002,113,536
2May 30, 2026 07:272,52413,978,3694,979,0001,332,0002,113,536
3May 30, 2026 07:272,59816,492,4395,124,0001,372,0002,113,536
4May 30, 2026 07:272,62114,732,9095,220,0001,333,0002,113,536
5May 30, 2026 07:272,63816,478,3015,263,0001,334,0002,113,536
6May 30, 2026 07:272,63814,399,4485,261,0001,335,0002,113,536
7May 30, 2026 07:272,64214,454,6705,273,0001,332,0002,113,536
8May 30, 2026 07:272,64614,329,6345,269,0001,348,0002,113,536
9May 30, 2026 07:272,65615,133,7155,275,0001,367,0002,113,536