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:47Tomislav TunkovicTomislav TunkovicScore: 1,515Success
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:561,38011,643,8623,451,0000524,288
2Aug 31, 2026 00:561,38211,615,2303,456,0000524,288
3Aug 31, 2026 00:561,48311,955,5933,709,0000524,288
4Aug 31, 2026 00:561,50111,951,5133,754,0000524,288
5Aug 31, 2026 00:561,51511,876,9483,788,0000524,288
6Aug 31, 2026 00:561,54411,989,2703,860,0000524,288
7Aug 31, 2026 00:561,54811,993,7243,872,0000524,288
8Aug 31, 2026 00:561,55922,076,8763,899,0000524,288
9Aug 31, 2026 00:561,56520,391,3552,809,0001,104,000524,288