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 1, 2026 15:28Victor MerckléVictor MerckléScore: 2,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 15:302,49913,828,8674,919,0001,329,0002,113,536
2Jun 1, 2026 15:302,50413,807,5274,931,0001,330,0002,113,536
3Jun 1, 2026 15:302,50513,798,2664,932,0001,331,0002,113,536
4Jun 1, 2026 15:302,52413,856,2784,982,0001,330,0002,113,536
5Jun 1, 2026 15:302,58214,007,7715,123,0001,333,0002,113,536
6Jun 1, 2026 15:302,58913,986,2615,148,0001,326,0002,113,536
7Jun 1, 2026 15:302,60614,036,5745,185,0001,330,0002,113,536
8Jun 1, 2026 15:302,61214,248,2915,197,0001,335,0002,113,536
9Jun 1, 2026 15:302,62214,386,6785,225,0001,331,0002,113,536