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 02:22Elijah KinElijah KinScore: 2,270Success
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 02:231,99514,122,7223,752,0001,237,0002,117,632
2Jun 9, 2026 02:232,00714,157,8963,785,0001,234,0002,117,632
3Jun 9, 2026 02:232,26214,728,3744,404,0001,252,0002,117,632
4Jun 9, 2026 02:232,26914,711,2794,410,0001,263,0002,117,632
5Jun 9, 2026 02:232,27014,682,8374,429,0001,247,0002,117,632
6Jun 9, 2026 02:232,27314,821,5994,437,0001,246,0002,117,632
7Jun 9, 2026 02:232,28314,971,5444,456,0001,252,0002,117,632
8Jun 9, 2026 02:232,31414,884,7454,531,0001,255,0002,117,632
9Jun 9, 2026 02:232,33314,984,4374,578,0001,255,0002,117,632