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 03:10Elijah KinElijah KinScore: 2,055Success
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 03:112,02517,133,6803,832,0001,232,0002,117,632
2Jun 9, 2026 03:112,02814,201,0033,831,0001,241,0002,117,632
3Jun 9, 2026 03:112,03414,148,7313,841,0001,244,0002,117,632
4Jun 9, 2026 03:112,04214,245,6903,859,0001,246,0002,117,632
5Jun 9, 2026 03:112,05514,624,4023,835,0001,304,0002,117,632
6Jun 9, 2026 03:112,14414,476,0584,100,0001,260,0002,117,632
7Jun 9, 2026 03:112,29614,783,5704,483,0001,257,0002,117,632
8Jun 9, 2026 03:112,30414,962,7304,517,0001,245,0002,117,632
9Jun 9, 2026 03:112,31114,834,6484,622,0001,156,0002,117,632