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:15Oleg KovalovOleg KovalovScore: 34,252Success
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:1534,090106,498,70984,223,0001,002,0002,437,120
2Jan 30, 2025 08:1534,091110,060,67082,219,0003,008,0002,490,368
3Jan 30, 2025 08:1534,117110,556,59882,282,0003,010,0002,535,424
4Jan 30, 2025 08:1534,238115,439,09581,568,0004,028,0002,482,176
5Jan 30, 2025 08:1534,252114,765,34682,609,0003,022,0002,531,328
6Jan 30, 2025 08:1534,254119,221,15684,627,0001,007,0002,482,176
7Jan 30, 2025 08:1534,268117,344,52982,646,0003,023,0002,297,856
8Jan 30, 2025 08:1534,358112,827,13182,865,0003,031,0002,293,760
9Jan 30, 2025 08:1534,550116,844,23984,366,0002,008,0002,437,120