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 3, 2026 00:09Andrew EpsteinAndrew EpsteinScore: 1,262Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 00:171,16811,938,7852,921,0000524,288
2Nov 3, 2026 00:171,24812,206,9893,120,0000524,288
3Nov 3, 2026 00:171,24912,191,8283,124,0000524,288
4Nov 3, 2026 00:171,25812,148,9233,146,0000524,288
5Nov 3, 2026 00:171,26212,217,0833,157,0000524,288
6Nov 3, 2026 00:171,26412,242,4983,161,0000524,288
7Nov 3, 2026 00:171,26412,312,2493,160,0000524,288
8Nov 3, 2026 00:171,26812,175,4713,170,0000524,288
9Nov 3, 2026 00:171,27612,334,1893,191,0000524,288