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 listMay 22, 2026 09:47M-RochatM-RochatScore: 4,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:474,74421,080,1729,766,0002,094,0002,121,728
2May 22, 2026 09:474,75521,062,8899,795,0002,094,0002,117,632
3May 22, 2026 09:474,75621,110,0129,788,0002,102,0002,117,632
4May 22, 2026 09:474,76221,130,7089,760,0002,146,0002,117,632
5May 22, 2026 09:474,76221,212,0439,783,0002,123,0002,117,632
6May 22, 2026 09:474,76821,834,1449,783,0002,139,0002,117,632
7May 22, 2026 09:474,76821,701,3929,794,0002,126,0002,117,632
8May 22, 2026 09:474,77221,784,3779,778,0002,153,0002,117,632
9May 22, 2026 09:474,77321,734,5579,819,0002,115,0002,121,728