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 listAug 1, 2026 05:03Victor MerckléVictor MerckléScore: 1,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 05:051,58612,520,7442,879,0001,087,0002,117,632stderr
2Aug 1, 2026 05:051,59012,417,5912,870,0001,107,0002,117,632stderr
3Aug 1, 2026 05:051,62212,507,4102,919,0001,136,0002,117,632stderr
4Aug 1, 2026 05:051,63112,663,2762,942,0001,136,0002,117,632stderr
5Aug 1, 2026 05:051,68513,450,4763,078,0001,135,0002,117,632stderr
6Aug 1, 2026 05:051,68812,795,4023,082,0001,139,0002,117,632stderr
7Aug 1, 2026 05:051,69213,066,8903,098,0001,134,0002,117,632stderr
8Aug 1, 2026 05:051,69513,439,9683,091,0001,147,0002,117,632stderr
9Aug 1, 2026 05:051,73613,554,4473,164,0001,176,0002,117,632stderr