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 20:06Elijah KinElijah KinScore: 3,165Success
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 20:082,97916,573,6936,309,0001,140,0002,117,632
2Jun 3, 2026 20:082,99216,551,5686,325,0001,155,0002,117,632
3Jun 3, 2026 20:083,00816,471,4916,351,0001,169,0002,117,632
4Jun 3, 2026 20:083,16016,857,9196,724,0001,176,0002,117,632
5Jun 3, 2026 20:083,16517,467,1466,724,0001,190,0002,117,632
6Jun 3, 2026 20:083,18118,462,4606,792,0001,161,0002,117,632
7Jun 3, 2026 20:083,18617,292,5486,793,0001,173,0002,117,632
8Jun 3, 2026 20:083,21217,513,0386,910,0001,121,0002,117,632
9Jun 3, 2026 20:083,24017,619,9606,903,0001,199,0002,117,632