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 27, 2026 05:53Elijah KinElijah KinScore: 2,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 05:542,02014,192,0373,814,0001,237,0002,117,632
2Jun 27, 2026 05:542,05514,218,3613,860,0001,278,0002,117,632
3Jun 27, 2026 05:542,15414,447,8004,118,0001,267,0002,117,632
4Jun 27, 2026 05:542,18014,531,1344,176,0001,275,0002,117,632
5Jun 27, 2026 05:542,19614,620,4844,231,0001,259,0002,117,632
6Jun 27, 2026 05:542,20214,660,4544,240,0001,266,0002,117,632
7Jun 27, 2026 05:542,25214,753,9044,402,0001,229,0002,117,632
8Jun 27, 2026 05:542,27215,962,7974,427,0001,255,0002,117,632
9Jun 27, 2026 05:542,33814,934,4464,572,0001,273,0002,117,632