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 listMay 21, 2026 05:10Jacob McDanielJacob McDanielScore: 2,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 05:112,71017,089,1045,568,0001,208,0002,121,728
2May 21, 2026 05:112,71017,222,6565,568,0001,207,0002,121,728
3May 21, 2026 05:112,71117,414,9005,583,0001,195,0002,121,728
4May 21, 2026 05:112,71216,638,1615,569,0001,212,0002,121,728
5May 21, 2026 05:112,73818,024,4485,628,0001,217,0002,121,728
6May 21, 2026 05:112,83018,063,2265,810,0001,267,0002,121,728
7May 21, 2026 05:112,88417,534,5725,933,0001,277,0002,121,728
8May 21, 2026 05:112,88617,518,7665,955,0001,261,0002,121,728
9May 21, 2026 05:112,91618,792,8056,002,0001,290,0002,121,728