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 21, 2026 15:24Charles CabergsCharles CabergsScore: 10,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 15:2410,28442,552,91119,541,0006,170,0002,502,656
2Apr 21, 2026 15:2410,30547,482,86919,819,0005,945,0002,514,944
3Apr 21, 2026 15:2410,56549,974,44020,319,0006,095,0002,342,912
4Apr 21, 2026 15:2410,59941,776,43523,441,0003,057,0002,514,944
5Apr 21, 2026 15:2410,68645,519,03819,524,0007,193,0002,498,560
6Apr 21, 2026 15:2410,68644,422,07621,578,0005,137,0002,314,240
7Apr 21, 2026 15:2410,82041,788,53622,042,0005,009,0002,506,752
8Apr 21, 2026 15:2411,03448,766,00222,478,0005,108,0002,347,008
9Apr 21, 2026 15:2411,12344,944,52921,849,0005,959,0002,498,560