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 listApr 13, 2026 05:27limanjun99limanjun99Score: 3,963Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 05:273,89226,018,9257,569,0002,162,0002,514,944
2Apr 13, 2026 05:273,90025,304,2407,584,0002,166,0002,502,656
3Apr 13, 2026 05:273,91025,450,4417,602,0002,172,0002,506,752
4Apr 13, 2026 05:273,95928,322,4167,919,0001,979,0002,289,664
5Apr 13, 2026 05:273,96327,166,7996,935,0002,972,0002,506,752
6Apr 13, 2026 05:273,96427,269,2276,937,0002,973,0002,285,568
7Apr 13, 2026 05:273,96429,677,2267,929,0001,982,0002,285,568
8Apr 13, 2026 05:273,96533,655,0477,931,0001,982,0002,285,568
9Apr 13, 2026 05:273,96927,882,0677,939,0001,984,0002,289,664