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 9, 2026 00:33Elijah KinElijah KinScore: 2,040Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 00:342,01914,173,6093,826,0001,222,0002,117,632
2Jun 9, 2026 00:342,02914,196,1263,841,0001,232,0002,117,632
3Jun 9, 2026 00:342,03014,160,2043,825,0001,252,0002,117,632
4Jun 9, 2026 00:342,03514,362,4573,841,0001,248,0002,117,632
5Jun 9, 2026 00:342,04014,243,2773,852,0001,248,0002,117,632
6Jun 9, 2026 00:342,04314,265,8403,867,0001,241,0002,117,632
7Jun 9, 2026 00:342,04414,209,4803,870,0001,241,0002,117,632
8Jun 9, 2026 00:342,20614,641,9764,254,0001,261,0002,117,632
9Jun 9, 2026 00:342,24914,801,6154,380,0001,243,0002,117,632