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 listNov 14, 2025 17:19izotoffizotoffScore: 34,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 17:1934,744116,395,06685,863,000998,0002,392,064
2Nov 14, 2025 17:1934,748112,775,91383,876,0002,995,0002,322,432
3Nov 14, 2025 17:1934,749117,168,92284,876,0001,997,0002,392,064
4Nov 14, 2025 17:1934,753116,714,84982,888,0003,994,0002,428,928
5Nov 14, 2025 17:1934,761112,786,13383,906,0002,996,0002,412,544
6Nov 14, 2025 17:1934,772115,360,62884,932,0001,998,0002,310,144
7Nov 14, 2025 17:1934,785110,424,46684,963,0001,999,0002,314,240
8Nov 14, 2025 17:1934,795111,376,69782,989,0003,999,0002,453,504
9Nov 14, 2025 17:1934,896113,735,78285,234,0002,005,0002,392,064