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 5, 2026 19:03Elijah KinElijah KinScore: 2,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 19:052,51715,321,0525,159,0001,134,0002,117,632
2Jun 5, 2026 19:052,57615,485,9285,292,0001,149,0002,117,632
3Jun 5, 2026 19:052,60315,906,9375,328,0001,180,0002,117,632
4Jun 5, 2026 19:052,62316,002,3645,405,0001,153,0002,117,632
5Jun 5, 2026 19:052,64916,179,3405,445,0001,178,0002,117,632
6Jun 5, 2026 19:052,66716,105,2845,496,0001,172,0002,117,632
7Jun 5, 2026 19:052,67616,251,6075,494,0001,196,0002,117,632
8Jun 5, 2026 19:052,67816,227,4845,551,0001,146,0002,117,632
9Jun 5, 2026 19:052,72416,407,5605,619,0001,192,0002,117,632