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 listJan 30, 2025 08:16Oleg KovalovOleg KovalovScore: 34,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 08:1633,983111,463,94982,959,0001,999,0002,473,984
2Jan 30, 2025 08:1633,984110,346,92082,961,0001,999,0002,543,616
3Jan 30, 2025 08:1633,987113,150,15981,970,0002,998,0002,486,272
4Jan 30, 2025 08:1634,074106,699,80383,182,0002,004,0002,465,792
5Jan 30, 2025 08:1634,084118,720,79380,199,0005,012,0002,449,408
6Jan 30, 2025 08:1634,139113,337,19481,332,0004,016,0002,506,752
7Jan 30, 2025 08:1634,140112,610,27982,338,0003,012,0002,449,408
8Jan 30, 2025 08:1634,142112,859,92582,343,0003,012,0002,543,616
9Jan 30, 2025 08:1634,340110,451,20181,858,0003,993,0002,465,792