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 16:22Elijah KinElijah KinScore: 4,180Success
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 16:224,03719,232,0556,706,0003,388,0002,117,632
2Jun 4, 2026 16:224,10620,563,9196,801,0003,464,0002,117,632
3Jun 4, 2026 16:224,10819,486,4476,718,0003,552,0002,117,632
4Jun 4, 2026 16:224,13119,493,0916,938,0003,391,0002,117,632
5Jun 4, 2026 16:224,18019,615,8937,035,0003,417,0002,117,632
6Jun 4, 2026 16:224,21719,742,5507,002,0003,542,0002,117,632
7Jun 4, 2026 16:224,21720,518,6737,094,0003,450,0002,117,632
8Jun 4, 2026 16:224,27319,828,5937,423,0003,260,0002,117,632
9Jun 4, 2026 16:224,30719,870,2977,218,0003,550,0002,117,632