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 20, 2026 12:50Victor MerckléVictor MerckléScore: 2,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 12:522,77316,380,4755,801,0001,132,0002,113,536
2May 20, 2026 12:522,78116,018,9915,819,0001,134,0002,113,536
3May 20, 2026 12:522,78614,746,2325,830,0001,135,0002,113,536
4May 20, 2026 12:522,80216,742,5465,862,0001,145,0002,113,536
5May 20, 2026 12:522,81514,846,2635,892,0001,147,0002,113,536
6May 20, 2026 12:522,82816,991,6095,931,0001,141,0002,113,536
7May 20, 2026 12:522,84714,894,4455,983,0001,136,0002,113,536
8May 20, 2026 12:522,85614,898,5046,007,0001,134,0002,113,536
9May 20, 2026 12:522,96816,559,8925,404,0002,016,0002,113,536