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 8, 2026 22:00Elijah KinElijah KinScore: 2,070Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 22:012,05214,194,0443,887,0001,245,0002,117,632
2Jun 8, 2026 22:012,05214,282,3063,883,0001,249,0002,117,632
3Jun 8, 2026 22:012,06214,116,6003,891,0001,264,0002,117,632
4Jun 8, 2026 22:012,06814,392,5623,912,0001,258,0002,117,632
5Jun 8, 2026 22:012,07014,296,5313,923,0001,253,0002,117,632
6Jun 8, 2026 22:012,10714,335,0364,150,0001,119,0002,117,632
7Jun 8, 2026 22:012,22314,700,7874,296,0001,262,0002,117,632
8Jun 8, 2026 22:012,25614,794,3254,394,0001,247,0002,117,632
9Jun 8, 2026 22:012,25814,761,4904,383,0001,262,0002,117,632