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 00:09olliecrowolliecrowScore: 4,165Success
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 00:164,01625,678,5617,539,0002,502,0002,396,160
2May 5, 2026 00:164,11129,582,7257,840,0002,439,0002,396,160
3May 5, 2026 00:164,14624,503,0247,827,0002,539,0002,387,968
4May 5, 2026 00:164,14730,461,5597,827,0002,542,0002,396,160
5May 5, 2026 00:164,16531,695,6837,817,0002,597,0002,392,064
6May 5, 2026 00:164,19929,319,2947,808,0002,690,0002,392,064
7May 5, 2026 00:164,20427,525,6087,811,0002,699,0002,400,256
8May 5, 2026 00:164,20734,720,4437,840,0002,678,0002,392,064
9May 5, 2026 00:164,21125,191,9957,896,0002,632,0002,392,064