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 listApr 13, 2026 15:08limanjun99limanjun99Score: 3,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 15:083,01426,201,1825,382,0002,152,0002,293,760
2Apr 13, 2026 15:083,01825,152,0185,390,0002,156,0002,514,944
3Apr 13, 2026 15:083,02025,047,4405,393,0002,157,0002,527,232
4Apr 13, 2026 15:083,03228,841,3685,415,0002,166,0002,293,760
5Apr 13, 2026 15:083,03323,343,1255,416,0002,166,0002,293,760
6Apr 13, 2026 15:083,03424,826,0316,503,0001,083,0002,293,760
7Apr 13, 2026 15:083,03722,111,3296,508,0001,084,0002,293,760
8Apr 13, 2026 15:083,04026,896,6445,428,0002,171,0002,293,760
9Apr 13, 2026 15:083,04727,182,5196,530,0001,088,0002,269,184