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 01:44Elijah KinElijah KinScore: 2,283Success
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 01:452,04216,661,4523,854,0001,252,0002,117,632
2Jun 9, 2026 01:452,04914,362,5953,868,0001,256,0002,117,632
3Jun 9, 2026 01:452,16017,051,9994,154,0001,248,0002,117,632
4Jun 9, 2026 01:452,22714,672,6724,335,0001,234,0002,117,632
5Jun 9, 2026 01:452,28315,204,0184,467,0001,242,0002,117,632
6Jun 9, 2026 01:452,29014,817,0424,461,0001,265,0002,117,632
7Jun 9, 2026 01:452,29714,886,9074,480,0001,264,0002,117,632
8Jun 9, 2026 01:452,34214,992,2964,558,0001,297,0002,117,632
9Jun 9, 2026 01:452,34915,407,2394,621,0001,253,0002,117,632