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 listFeb 19, 2025 20:54Ian MckibbenIan MckibbenScore: 324,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2025 20:54323,934829,395,727809,835,00002,445,312
2Feb 19, 2025 20:54323,938830,556,927809,846,00002,535,424
3Feb 19, 2025 20:54323,943831,866,201809,858,00002,535,424
4Feb 19, 2025 20:54323,970836,626,301809,924,00002,453,504
5Feb 19, 2025 20:54324,016836,288,920810,039,00002,445,312
6Feb 19, 2025 20:54324,064836,623,960810,159,00002,449,408
7Feb 19, 2025 20:54324,066841,335,300809,168,000998,0002,445,312
8Feb 19, 2025 20:54324,120837,876,033809,301,000999,0002,535,424
9Feb 19, 2025 20:54324,152834,378,227808,383,0001,998,0002,273,280