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 listJun 12, 2026 04:31Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 04:33013,063,5383,489,0001,540,0002,125,824pos 0: expected 116 got 167
2Jun 12, 2026 04:331,84312,200,2982,934,0001,675,0002,125,824
3Jun 12, 2026 04:331,86012,227,8912,937,0001,713,0002,125,824
4Jun 12, 2026 04:331,95012,651,6503,304,0001,572,0002,125,824
5Jun 12, 2026 04:331,98813,006,8843,420,0001,552,0002,125,824
6Jun 12, 2026 04:331,99012,582,0423,425,0001,550,0002,125,824
7Jun 12, 2026 04:332,00012,952,2023,441,0001,560,0002,125,824
8Jun 12, 2026 04:332,00812,965,1123,453,0001,567,0002,125,824
9Jun 12, 2026 04:332,02012,714,1913,479,0001,571,0002,125,824