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 30, 2026 23:52Tomislav TunkovicTomislav TunkovicScore: 1,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 23:591,39813,015,4663,495,0000524,288
2Aug 30, 2026 23:591,44211,862,5782,483,0001,123,000524,288
3Aug 30, 2026 23:591,45611,894,9343,641,0000524,288
4Aug 30, 2026 23:591,47211,863,7552,529,0001,151,000524,288
5Aug 30, 2026 23:591,51711,992,6573,794,0000524,288
6Aug 30, 2026 23:591,52611,964,9493,817,0000524,288
7Aug 30, 2026 23:591,55212,022,1973,880,0000524,288
8Aug 30, 2026 23:591,55612,047,9892,761,0001,130,000524,288
9Aug 30, 2026 23:591,59420,455,4032,891,0001,094,000524,288