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 19:04olliecrowolliecrowScore: 26,793Success
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 19:0526,69985,362,10864,527,0002,221,0002,531,328
2May 5, 2026 19:0526,76482,681,83064,853,0002,058,0002,531,328
3May 5, 2026 19:0526,78684,766,20664,715,0002,250,0002,535,424
4May 5, 2026 19:0526,79281,872,04364,677,0002,305,0002,535,424
5May 5, 2026 19:0526,79383,168,24464,613,0002,371,0002,519,040
6May 5, 2026 19:0526,80285,161,39264,704,0002,301,0002,531,328
7May 5, 2026 19:0526,81782,196,03364,748,0002,296,0002,527,232
8May 5, 2026 19:0526,82881,371,09764,671,0002,401,0002,519,040
9May 5, 2026 19:0526,84584,758,45765,025,0002,089,0002,523,136