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 listMay 5, 2026 14:28olliecrowolliecrowScore: 8,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 14:318,50229,373,48516,894,0004,361,0002,461,696
2May 5, 2026 14:318,50329,385,00216,839,0004,420,0002,433,024
3May 5, 2026 14:318,51129,413,42216,832,0004,446,0002,461,696
4May 5, 2026 14:318,53829,466,67116,904,0004,443,0002,424,832
5May 5, 2026 14:318,56629,532,13416,981,0004,435,0002,445,312
6May 5, 2026 14:318,58529,559,50016,879,0004,584,0002,445,312
7May 5, 2026 14:318,74432,691,02717,197,0004,664,0002,457,600
8May 5, 2026 14:318,98430,525,41918,107,0004,354,0002,428,928
9May 5, 2026 14:319,01830,520,05618,041,0004,505,0002,445,312