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 18:44Jacob McDanielJacob McDanielScore: 2,458Success
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 18:442,42117,161,3834,922,0001,131,0002,117,632
2May 21, 2026 18:442,44517,865,2214,913,0001,200,0002,117,632
3May 21, 2026 18:442,45018,403,8584,921,0001,206,0002,117,632
4May 21, 2026 18:442,45316,030,8254,924,0001,210,0002,117,632
5May 21, 2026 18:442,45817,292,8294,940,0001,205,0002,117,632
6May 21, 2026 18:442,46016,375,4874,941,0001,210,0002,117,632
7May 21, 2026 18:442,46815,921,9584,962,0001,209,0002,117,632
8May 21, 2026 18:442,46917,970,9865,011,0001,162,0002,117,632
9May 21, 2026 18:442,65016,038,1415,341,0001,284,0002,117,632