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 listJul 7, 2026 22:01Victor MerckléVictor MerckléScore: 1,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 22:051,67212,260,2923,039,0001,141,0002,117,632stderr
2Jul 7, 2026 22:051,68012,331,2463,046,0001,154,0002,117,632stderr
3Jul 7, 2026 22:051,68112,214,8633,055,0001,148,0002,117,632stderr
4Jul 7, 2026 22:051,77113,047,2513,235,0001,194,0002,117,632stderr
5Jul 7, 2026 22:051,78112,524,7393,237,0001,217,0002,117,632stderr
6Jul 7, 2026 22:051,78312,539,5533,248,0001,211,0002,117,632stderr
7Jul 7, 2026 22:051,79113,038,4273,280,0001,198,0002,117,632stderr
8Jul 7, 2026 22:051,79512,612,7683,273,0001,216,0002,117,632stderr
9Jul 7, 2026 22:051,82613,134,7893,327,0001,238,0002,117,632stderr