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 listAug 31, 2024 22:24Yuriy LyfenkoYuriy LyfenkoScore: 59,138Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2024 22:2458,729172,471,847133,838,00012,984,0002,449,408
2Aug 31, 2024 22:2458,738171,661,699136,855,0009,989,0002,281,472
3Aug 31, 2024 22:2458,880173,610,882138,187,0009,012,0002,482,176
4Aug 31, 2024 22:2458,926176,552,432138,295,0009,019,0002,334,720
5Aug 31, 2024 22:2458,990171,970,868134,434,00013,042,0002,400,256
6Aug 31, 2024 22:2459,055175,493,111135,585,00012,052,0002,494,464
7Aug 31, 2024 22:2459,138174,247,233135,859,00011,987,0002,293,760
8Aug 31, 2024 22:2459,180175,722,541135,955,00011,996,0002,297,856
9Aug 31, 2024 22:2459,361178,462,452140,382,0008,021,0002,347,008
10Aug 31, 2024 22:2459,373173,263,771139,406,0009,026,0002,293,760
11Aug 31, 2024 22:2459,564173,952,171139,915,0008,994,0002,289,664
12Aug 31, 2024 22:2459,661173,532,558138,141,00011,011,0002,387,968