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 listJul 2, 2026 09:35A_ShamanA_ShamanScore: 15,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 09:3515,20047,452,61434,610,0003,392,0002,113,536
2Jul 2, 2026 09:3515,20547,486,24134,666,0003,348,0002,113,536
3Jul 2, 2026 09:3515,23647,554,15434,704,0003,388,0002,113,536
4Jul 2, 2026 09:3515,25347,589,91434,792,0003,342,0002,113,536
5Jul 2, 2026 09:3515,28947,634,33734,872,0003,351,0002,113,536
6Jul 2, 2026 09:3515,41247,949,09935,194,0003,338,0002,113,536
7Jul 2, 2026 09:3515,55548,373,81435,510,0003,378,0002,113,536
8Jul 2, 2026 09:3515,59048,385,88935,744,0003,232,0002,113,536
9Jul 2, 2026 09:3515,71848,870,56534,828,0004,467,0002,113,536