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:23Victor MerckléVictor MerckléScore: 2,166Success
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:242,15613,032,3764,154,0001,237,0002,113,536
2Jun 2, 2026 12:242,15614,896,7904,150,0001,242,0002,113,536
3Jun 2, 2026 12:242,15813,051,6064,154,0001,241,0002,113,536
4Jun 2, 2026 12:242,16413,086,6374,170,0001,242,0002,113,536
5Jun 2, 2026 12:242,16613,122,0294,172,0001,243,0002,113,536
6Jun 2, 2026 12:242,17013,155,3794,181,0001,246,0002,113,536
7Jun 2, 2026 12:242,18613,170,5834,206,0001,259,0002,113,536
8Jun 2, 2026 12:242,19113,131,3104,216,0001,262,0002,113,536
9Jun 2, 2026 12:242,23813,235,9184,350,0001,245,0002,113,536