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 listNov 6, 2024 07:14Mikhail ShirokovMikhail ShirokovScore: 672,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 07:14671,8291,707,824,0701,678,574,000999,0002,310,144
2Nov 6, 2024 07:14671,8571,703,145,8541,678,643,000999,0002,506,752
3Nov 6, 2024 07:14671,8981,709,102,0151,677,748,0001,998,0002,310,144
4Nov 6, 2024 07:14671,9241,707,136,3191,678,811,000999,0002,310,144
5Nov 6, 2024 07:14672,0101,710,442,4931,679,025,000999,0002,310,144
6Nov 6, 2024 07:14672,0371,705,191,7411,679,093,000999,0002,449,408
7Nov 6, 2024 07:14672,3291,704,854,0811,679,824,000999,0002,482,176
8Nov 6, 2024 07:14672,5551,711,601,8601,678,390,0002,997,0002,441,216
9Nov 6, 2024 07:14672,5941,706,041,2751,679,488,0001,998,0002,334,720