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 19, 2026 21:09Jacob McDanielJacob McDanielScore: 2,804Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 21:092,68517,371,0565,594,0001,119,0002,117,632
2May 19, 2026 21:092,70117,673,3555,558,0001,195,0002,117,632
3May 19, 2026 21:092,70416,320,5515,569,0001,193,0002,117,632
4May 19, 2026 21:092,76818,350,1875,656,0001,266,0002,117,632
5May 19, 2026 21:092,80416,218,6905,742,0001,269,0002,117,632
6May 19, 2026 21:092,80617,587,6075,755,0001,262,0002,117,632
7May 19, 2026 21:092,82218,103,5705,797,0001,259,0002,117,632
8May 19, 2026 21:092,82217,407,7425,782,0001,274,0002,117,632
9May 19, 2026 21:092,96140,056,8556,220,0001,184,0002,117,632