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 listMay 22, 2026 13:04M-RochatM-RochatScore: 4,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 13:054,20722,663,4439,466,0001,053,0002,117,632
2May 22, 2026 13:054,21419,855,9579,270,0001,267,0002,113,536
3May 22, 2026 13:054,30519,991,1329,393,0001,370,0002,113,536
4May 22, 2026 13:054,30920,305,9749,710,0001,064,0002,113,536
5May 22, 2026 13:054,31019,951,8969,403,0001,374,0002,113,536
6May 22, 2026 13:054,31019,936,4169,710,0001,065,0002,113,536
7May 22, 2026 13:054,31420,013,5629,721,0001,065,0002,113,536
8May 22, 2026 13:054,31420,086,4939,721,0001,064,0002,113,536
9May 22, 2026 13:054,31720,364,2099,729,0001,064,0002,113,536