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 listJul 9, 2023 18:29Bernard TeoBernard TeoScore: 1,262,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2023 18:291,261,5953,224,669,9223,153,986,28102,260,992
2Jul 9, 2023 18:291,262,2583,208,967,3803,155,645,50302,252,800
3Jul 9, 2023 18:291,262,6193,216,010,9213,156,546,73502,260,992