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 6, 2026 23:23Elijah KinElijah KinScore: 2,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 23:252,24914,688,9094,516,0001,107,0002,117,632
2Jun 6, 2026 23:252,25514,658,7124,531,0001,107,0002,117,632
3Jun 6, 2026 23:252,25716,530,4654,533,0001,111,0002,117,632
4Jun 6, 2026 23:252,27414,719,6614,574,0001,112,0002,117,632
5Jun 6, 2026 23:252,27414,646,3734,577,0001,110,0002,117,632
6Jun 6, 2026 23:252,30614,766,6304,568,0001,199,0002,117,632
7Jun 6, 2026 23:252,32814,816,3324,586,0001,234,0002,117,632
8Jun 6, 2026 23:252,36414,950,1344,684,0001,227,0002,117,632
9Jun 6, 2026 23:252,39415,000,8164,875,0001,112,0002,117,632