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 22, 2026 04:39olliecrowolliecrowScore: 44,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 04:4144,347118,949,437107,873,0002,996,0002,347,008
2Apr 22, 2026 04:4144,382119,075,295106,958,0003,998,0002,502,656
3Apr 22, 2026 04:4144,401119,042,637107,004,0004,000,0002,342,912
4Apr 22, 2026 04:4144,416119,192,734105,038,0006,002,0002,351,104
5Apr 22, 2026 04:4144,421119,152,379107,052,0004,001,0002,363,392
6Apr 22, 2026 04:4144,449119,174,560106,119,0005,005,0002,428,928
7Apr 22, 2026 04:4144,455125,174,048106,132,0005,006,0002,514,944
8Apr 22, 2026 04:4144,739118,985,321106,855,0004,993,0002,437,120
9Apr 22, 2026 04:4144,788119,066,716107,972,0003,998,0002,564,096