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 3, 2026 06:08Elijah KinElijah KinScore: 7,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 06:087,06326,815,23213,468,0004,190,0002,117,632
2Jun 3, 2026 06:087,06926,928,53813,468,0004,205,0002,113,536
3Jun 3, 2026 06:087,08026,922,32113,466,0004,234,0002,113,536
4Jun 3, 2026 06:087,08826,971,37113,462,0004,258,0002,117,632
5Jun 3, 2026 06:087,09327,308,76013,595,0004,139,0002,113,536
6Jun 3, 2026 06:087,12227,158,59113,542,0004,263,0002,113,536
7Jun 3, 2026 06:087,12827,067,11413,673,0004,149,0002,113,536
8Jun 3, 2026 06:087,31327,542,45114,047,0004,237,0002,113,536
9Jun 3, 2026 06:087,43427,803,44914,354,0004,231,0002,117,632