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:58Elijah KinElijah KinScore: 2,311Success
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:592,07714,392,7763,949,0001,244,0002,117,632
2Jun 8, 2026 22:592,29415,261,1744,471,0001,266,0002,117,632
3Jun 8, 2026 22:592,29714,914,1114,480,0001,263,0002,117,632
4Jun 8, 2026 22:592,30414,829,8104,492,0001,270,0002,117,632
5Jun 8, 2026 22:592,31114,936,1584,669,0001,110,0002,117,632
6Jun 8, 2026 22:592,34114,938,3654,608,0001,245,0002,117,632
7Jun 8, 2026 22:592,35614,930,3194,646,0001,245,0002,117,632
8Jun 8, 2026 22:592,37715,395,1734,699,0001,245,0002,117,632
9Jun 8, 2026 22:592,39115,129,9234,695,0001,283,0002,117,632