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 04:38Elijah KinElijah KinScore: 2,057Success
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 04:392,03214,189,8173,882,0001,198,0002,117,632
2Jun 9, 2026 04:392,03214,303,6523,875,0001,206,0002,117,632
3Jun 9, 2026 04:392,04314,251,4753,888,0001,220,0002,117,632
4Jun 9, 2026 04:392,04814,239,4373,916,0001,204,0002,117,632
5Jun 9, 2026 04:392,05714,245,4033,935,0001,209,0002,117,632
6Jun 9, 2026 04:392,16714,514,6424,230,0001,188,0002,117,632
7Jun 9, 2026 04:392,16814,565,9804,225,0001,196,0002,117,632
8Jun 9, 2026 04:392,20614,590,6254,311,0001,205,0002,117,632
9Jun 9, 2026 04:392,26214,677,7074,443,0001,214,0002,117,632