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 listDec 29, 2025 14:40Josu San MartinJosu San MartinScore: 27,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 14:4027,58893,908,36257,976,00010,995,0002,392,064
2Dec 29, 2025 14:4027,60194,255,34358,002,00011,000,0002,367,488
3Dec 29, 2025 14:4027,61198,905,78759,024,00010,004,0002,514,944
4Dec 29, 2025 14:4027,65693,393,57561,123,0008,016,0002,514,944
5Dec 29, 2025 14:4027,72291,267,34663,278,0006,026,0002,301,952
6Dec 29, 2025 14:4027,76395,849,93561,360,0008,047,0002,519,040
7Dec 29, 2025 14:4027,81192,152,25562,474,0007,053,0002,514,944
8Dec 29, 2025 14:4027,81794,436,68863,496,0006,047,0002,404,352
9Dec 29, 2025 14:4027,83296,015,37962,521,0007,058,0002,519,040