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 12, 2026 13:38limanjun99limanjun99Score: 67,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 12, 2026 13:3867,021193,095,802165,547,0002,006,000757,760
2Apr 12, 2026 13:3867,028199,005,195164,561,0003,010,000765,952
3Apr 12, 2026 13:3867,030193,095,261165,568,0002,006,000917,504
4Apr 12, 2026 13:3867,030194,002,823164,565,0003,010,000905,216
5Apr 12, 2026 13:3867,035196,163,554163,574,0004,014,000823,296
6Apr 12, 2026 13:3867,085191,340,825162,722,0004,991,000720,896
7Apr 12, 2026 13:3867,108194,251,460161,780,0005,991,000917,504
8Apr 12, 2026 13:3867,120190,865,974163,804,0003,995,000839,680
9Apr 12, 2026 13:3867,138190,680,124164,847,0002,997,000720,896