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 10:03Victor MerckléVictor MerckléScore: 2,614Success
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 10:052,49813,791,4074,923,0001,322,0002,113,536
2Jun 1, 2026 10:052,50513,873,1374,939,0001,325,0002,113,536
3Jun 1, 2026 10:052,51314,120,9214,957,0001,327,0002,113,536
4Jun 1, 2026 10:052,52413,882,3564,982,0001,329,0002,113,536
5Jun 1, 2026 10:052,61414,094,3685,209,0001,327,0002,113,536
6Jun 1, 2026 10:052,63214,042,8155,242,0001,338,0002,113,536
7Jun 1, 2026 10:052,65114,163,7125,289,0001,339,0002,113,536
8Jun 1, 2026 10:052,66014,513,1815,311,0001,341,0002,113,536
9Jun 1, 2026 10:052,68214,164,4145,346,0001,359,0002,113,536