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:19Tomislav TunkovicTomislav TunkovicScore: 1,532Success
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:231,38011,595,5603,452,0000524,288
2Aug 31, 2026 00:231,43711,783,5363,594,0000524,288
3Aug 31, 2026 00:231,50011,966,0573,751,0000524,288
4Aug 31, 2026 00:231,52111,981,7463,804,0000524,288
5Aug 31, 2026 00:231,53211,949,1933,830,0000524,288
6Aug 31, 2026 00:231,53611,937,8193,841,0000524,288
7Aug 31, 2026 00:231,54012,060,9043,852,0000524,288
8Aug 31, 2026 00:231,54712,585,7663,868,0000524,288
9Aug 31, 2026 00:231,60912,132,6412,848,0001,175,000524,288