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 15:36Elijah KinElijah KinScore: 2,281Success
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 15:372,24814,719,8724,400,0001,222,0002,117,632
2Jun 8, 2026 15:372,25714,748,6114,424,0001,220,0002,117,632
3Jun 8, 2026 15:372,26114,830,2954,410,0001,244,0002,117,632
4Jun 8, 2026 15:372,26214,788,4554,409,0001,247,0002,117,632
5Jun 8, 2026 15:372,28114,787,0364,451,0001,252,0002,117,632
6Jun 8, 2026 15:372,36515,024,2664,678,0001,236,0002,117,632
7Jun 8, 2026 15:372,43215,168,5384,805,0001,275,0002,117,632
8Jun 8, 2026 15:372,60115,802,4235,255,0001,248,0002,117,632
9Jun 8, 2026 15:372,65316,251,9005,520,0001,114,0002,117,632