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 2, 2026 12:03Victor MerckléVictor MerckléScore: 2,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2026 12:052,15013,030,0874,137,0001,239,0002,113,536
2Jun 2, 2026 12:052,18013,110,9364,203,0001,248,0002,113,536
3Jun 2, 2026 12:052,21813,140,1604,262,0001,284,0002,113,536
4Jun 2, 2026 12:052,22413,308,2684,316,0001,245,0002,113,536
5Jun 2, 2026 12:052,23013,343,4954,332,0001,244,0002,113,536
6Jun 2, 2026 12:052,23013,177,8674,328,0001,248,0002,113,536
7Jun 2, 2026 12:052,23213,132,7264,335,0001,246,0002,113,536
8Jun 2, 2026 12:052,24213,161,8564,356,0001,250,0002,113,536
9Jun 2, 2026 12:052,24613,238,0044,361,0001,255,0002,113,536