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 7, 2026 15:50Elijah KinElijah KinScore: 2,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 15:522,21814,667,9634,435,0001,112,0002,117,632
2Jun 7, 2026 15:522,21814,672,5084,435,0001,110,0002,117,632
3Jun 7, 2026 15:522,33614,889,6524,729,0001,113,0002,117,632
4Jun 7, 2026 15:522,33714,839,2384,732,0001,111,0002,117,632
5Jun 7, 2026 15:522,36814,964,6664,812,0001,108,0002,117,632
6Jun 7, 2026 15:522,41915,112,0524,945,0001,103,0002,117,632
7Jun 7, 2026 15:522,45915,253,9875,044,0001,104,0002,117,632
8Jun 7, 2026 15:522,47115,116,6245,071,0001,107,0002,117,632
9Jun 7, 2026 15:522,49515,362,4105,132,0001,106,0002,117,632