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 11:48Victor MerckléVictor MerckléScore: 2,605Success
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 11:502,52213,784,9664,975,0001,330,0002,113,536
2Jun 1, 2026 11:502,53513,878,6674,999,0001,340,0002,113,536
3Jun 1, 2026 11:502,54313,931,0275,013,0001,345,0002,113,536
4Jun 1, 2026 11:502,54813,977,8985,021,0001,349,0002,113,536
5Jun 1, 2026 11:502,60514,144,0945,194,0001,319,0002,113,536
6Jun 1, 2026 11:502,60614,518,9835,188,0001,327,0002,113,536
7Jun 1, 2026 11:502,60814,136,8225,196,0001,326,0002,113,536
8Jun 1, 2026 11:502,61014,033,0645,203,0001,323,0002,113,536
9Jun 1, 2026 11:502,62214,123,8925,235,0001,322,0002,113,536