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 10, 2026 02:04Elijah KinElijah KinScore: 2,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 02:062,37814,875,2104,726,0001,219,0002,117,632
2Jun 10, 2026 02:062,57415,418,7435,197,0001,238,0002,117,632
3Jun 10, 2026 02:062,65415,601,7165,404,0001,233,0002,117,632
4Jun 10, 2026 02:062,65615,635,1225,413,0001,229,0002,117,632
5Jun 10, 2026 02:062,67715,570,1305,464,0001,229,0002,117,632
6Jun 10, 2026 02:062,68615,574,9755,464,0001,251,0002,117,632
7Jun 10, 2026 02:062,69215,666,2095,492,0001,240,0002,117,632
8Jun 10, 2026 02:062,70116,163,8365,503,0001,251,0002,117,632
9Jun 10, 2026 02:062,72915,772,8935,581,0001,242,0002,117,632