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 5, 2026 19:41Elijah KinElijah KinScore: 2,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 19:422,51715,340,6445,186,0001,108,0002,117,632
2Jun 5, 2026 19:422,57815,629,6675,334,0001,112,0002,117,632
3Jun 5, 2026 19:422,59215,476,4665,373,0001,107,0002,117,632
4Jun 5, 2026 19:422,63416,039,8575,484,0001,102,0002,117,632
5Jun 5, 2026 19:422,63815,676,6275,487,0001,110,0002,117,632
6Jun 5, 2026 19:422,66216,129,8735,553,0001,104,0002,117,632
7Jun 5, 2026 19:422,68916,377,9175,622,0001,102,0002,117,632
8Jun 5, 2026 19:422,73716,322,2675,719,0001,125,0002,117,632
9Jun 5, 2026 19:422,74416,366,2655,736,0001,125,0002,117,632