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 3, 2026 19:56Elijah KinElijah KinScore: 3,146Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 3, 2026 19:572,98316,651,8916,293,0001,165,0002,117,632
2Jun 3, 2026 19:572,98416,646,1856,313,0001,148,0002,117,632
3Jun 3, 2026 19:573,05316,593,0106,436,0001,197,0002,117,632
4Jun 3, 2026 19:573,14416,985,8966,752,0001,110,0002,117,632
5Jun 3, 2026 19:573,14616,918,5986,694,0001,171,0002,117,632
6Jun 3, 2026 19:573,15917,428,6896,718,0001,181,0002,117,632
7Jun 3, 2026 19:573,17717,423,8476,762,0001,181,0002,117,632
8Jun 3, 2026 19:573,19518,882,4226,805,0001,184,0002,117,632
9Jun 3, 2026 19:573,23417,366,6436,957,0001,129,0002,117,632