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 listJun 26, 2026 19:51A_ShamanA_ShamanScore: 16,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 19:5116,27749,824,08536,352,0004,341,0002,113,536
2Jun 26, 2026 19:5116,27849,949,38736,344,0004,351,0002,113,536
3Jun 26, 2026 19:5116,45850,250,68136,752,0004,393,0002,113,536
4Jun 26, 2026 19:5116,50650,449,21636,821,0004,446,0002,113,536
5Jun 26, 2026 19:5116,52850,447,59837,095,0004,226,0002,113,536
6Jun 26, 2026 19:5116,67250,844,05437,246,0004,434,0002,113,536
7Jun 26, 2026 19:5116,67950,864,18137,472,0004,227,0002,113,536
8Jun 26, 2026 19:5116,68450,904,34437,358,0004,352,0002,113,536
9Jun 26, 2026 19:5116,68851,292,09137,387,0004,335,0002,113,536