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 listAug 31, 2026 00:08Tomislav TunkovicTomislav TunkovicScore: 1,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 00:121,38411,630,9733,462,0000524,288
2Aug 31, 2026 00:121,49211,949,4643,732,0000524,288
3Aug 31, 2026 00:121,53912,004,7923,848,0000524,288
4Aug 31, 2026 00:121,54013,644,2043,852,0000524,288
5Aug 31, 2026 00:121,54011,950,6483,852,0000524,288
6Aug 31, 2026 00:121,54212,040,1163,855,0000524,288
7Aug 31, 2026 00:121,54411,982,0323,860,0000524,288
8Aug 31, 2026 00:121,54712,619,7213,869,0000524,288
9Aug 31, 2026 00:121,55012,624,7653,877,0000524,288