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 20, 2026 12:11Jacob McDanielJacob McDanielScore: 2,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 12:112,73019,184,2755,623,0001,203,0002,117,632
2May 20, 2026 12:112,75516,176,3505,644,0001,245,0002,117,632
3May 20, 2026 12:112,77417,134,6645,679,0001,257,0002,117,632
4May 20, 2026 12:112,78117,603,0285,692,0001,261,0002,117,632
5May 20, 2026 12:112,79618,162,1245,725,0001,265,0002,117,632
6May 20, 2026 12:112,81816,357,7425,788,0001,259,0002,117,632
7May 20, 2026 12:112,82017,981,1155,798,0001,253,0002,117,632
8May 20, 2026 12:112,83718,206,3645,820,0001,273,0002,117,632
9May 20, 2026 12:112,85529,460,1015,993,0001,145,0002,117,632