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 9, 2026 05:00Elijah KinElijah KinScore: 2,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 05:012,03014,107,2923,889,0001,187,0002,117,632
2Jun 9, 2026 05:012,03314,156,1243,881,0001,202,0002,117,632
3Jun 9, 2026 05:012,15914,527,3454,207,0001,192,0002,117,632
4Jun 9, 2026 05:012,18514,560,2754,253,0001,210,0002,117,632
5Jun 9, 2026 05:012,29814,881,5704,559,0001,187,0002,117,632
6Jun 9, 2026 05:012,30415,455,5164,546,0001,216,0002,117,632
7Jun 9, 2026 05:012,33314,951,9534,641,0001,193,0002,117,632
8Jun 9, 2026 05:012,35915,021,9004,691,0001,207,0002,117,632
9Jun 9, 2026 05:012,39215,084,9994,778,0001,202,0002,117,632