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 4, 2026 18:10Elijah KinElijah KinScore: 4,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 18:103,96219,064,3236,497,0003,408,0002,117,632
2Jun 4, 2026 18:103,97119,098,4366,512,0003,417,0002,117,632
3Jun 4, 2026 18:103,97219,055,0916,520,0003,410,0002,117,632
4Jun 4, 2026 18:103,97619,084,8876,502,0003,439,0002,117,632
5Jun 4, 2026 18:104,00020,735,3056,574,0003,428,0002,117,632
6Jun 4, 2026 18:104,00219,160,5706,554,0003,453,0002,117,632
7Jun 4, 2026 18:104,01919,232,0046,625,0003,424,0002,117,632
8Jun 4, 2026 18:104,19619,634,0447,281,0003,209,0002,117,632
9Jun 4, 2026 18:104,24019,799,4987,408,0003,192,0002,117,632