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 01:15olliecrowolliecrowScore: 3,954Success
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 01:213,80027,608,8387,124,0002,377,0002,424,832
2May 5, 2026 01:213,85228,404,4637,200,0002,430,0002,433,024
3May 5, 2026 01:213,88428,646,7497,259,0002,452,0002,420,736
4May 5, 2026 01:213,92228,309,2577,384,0002,421,0002,424,832
5May 5, 2026 01:213,95426,832,8247,389,0002,496,0002,412,544
6May 5, 2026 01:213,97426,327,7917,404,0002,531,0002,416,640
7May 5, 2026 01:214,00624,407,2047,475,0002,540,0002,420,736
8May 5, 2026 01:214,01625,202,3967,397,0002,645,0002,424,832
9May 5, 2026 01:214,06627,480,2437,469,0002,696,0002,424,832