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:31A_ShamanA_ShamanScore: 15,109Success
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:3215,02147,044,99734,142,0003,412,0002,113,536
2Jul 2, 2026 09:3215,02446,932,81634,324,0003,236,0002,113,536
3Jul 2, 2026 09:3215,04647,036,71134,358,0003,259,0002,113,536
4Jul 2, 2026 09:3215,05447,133,83634,298,0003,339,0002,113,536
5Jul 2, 2026 09:3215,10947,213,83834,371,0003,402,0002,113,536
6Jul 2, 2026 09:3215,11247,225,09334,479,0003,302,0002,113,536
7Jul 2, 2026 09:3215,13848,605,47534,521,0003,324,0002,113,536
8Jul 2, 2026 09:3215,15447,240,23434,616,0003,270,0002,113,536
9Jul 2, 2026 09:3215,26547,695,54133,741,0004,422,0002,113,536