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 22:10gchebanovgchebanovScore: 28,204Success
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 22:1026,986144,551,85067,465,86002,236,416
2Jul 9, 2023 22:1027,017135,311,76067,542,21202,236,416
3Jul 9, 2023 22:1027,140133,434,96467,849,19602,232,320
4Jul 9, 2023 22:1028,13592,054,33962,299,0008,038,0002,330,624
5Jul 9, 2023 22:1028,18291,343,36463,410,0007,045,0002,379,776
6Jul 9, 2023 22:1028,19497,379,52063,436,0007,048,0002,387,968
7Jul 9, 2023 22:1028,20496,435,56562,453,0008,058,0002,502,656
8Jul 9, 2023 22:1028,31898,434,69365,809,0004,985,0002,392,064
9Jul 9, 2023 22:1028,32797,464,38862,838,0007,979,0002,457,600
10Jul 9, 2023 22:1028,35693,213,97862,904,0007,987,0002,355,200
11Jul 9, 2023 22:1028,39293,573,20063,983,0006,998,0002,387,968
12Jul 9, 2023 22:1028,598101,164,45963,440,0008,055,0002,387,968