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 21:28Andrew EpsteinAndrew EpsteinScore: 1,387Success
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 21:291,26612,228,4163,167,0000524,288
2Nov 2, 2026 21:291,26912,205,6853,174,0000524,288
3Nov 2, 2026 21:291,38212,500,4513,456,0000524,288
4Nov 2, 2026 21:291,38412,651,3783,462,0000524,288
5Nov 2, 2026 21:291,38712,485,0203,469,0000524,288
6Nov 2, 2026 21:291,38812,516,8463,471,0000524,288
7Nov 2, 2026 21:291,39112,884,0083,478,0000524,288
8Nov 2, 2026 21:291,39212,543,2673,482,0000524,288
9Nov 2, 2026 21:291,39612,919,8033,491,0000524,288