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 listNov 2, 2026 22:13Andrew EpsteinAndrew EpsteinScore: 1,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 2, 2026 22:141,19612,209,9712,990,00002,121,728stderr
2Nov 2, 2026 22:141,20321,673,8501,532,0001,476,0002,121,728stderr
3Nov 2, 2026 22:141,28212,377,4313,205,00002,121,728stderr
4Nov 2, 2026 22:141,32114,807,4492,263,0001,040,0002,121,728stderr
5Nov 2, 2026 22:141,32513,018,9381,867,0001,446,0002,121,728stderr
6Nov 2, 2026 22:141,32612,422,6491,857,0001,460,0002,121,728stderr
7Nov 2, 2026 22:141,32712,504,8721,877,0001,441,0002,121,728stderr
8Nov 2, 2026 22:141,32912,864,8161,865,0001,458,0002,121,728stderr
9Nov 2, 2026 22:141,46112,827,4262,585,0001,069,0002,121,728stderr