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 13:11M-RochatM-RochatScore: 4,307Success
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 13:114,19619,790,3309,237,0001,255,0002,113,536
2May 22, 2026 13:114,20319,773,2819,253,0001,255,0002,113,536
3May 22, 2026 13:114,20619,840,0069,464,0001,052,0002,121,728
4May 22, 2026 13:114,29819,988,7439,684,0001,062,0002,113,536
5May 22, 2026 13:114,30720,023,1159,705,0001,064,0002,113,536
6May 22, 2026 13:114,31120,001,5779,716,0001,063,0002,113,536
7May 22, 2026 13:114,31620,128,0399,728,0001,064,0002,113,536
8May 22, 2026 13:114,32320,052,2259,434,0001,375,0002,113,536
9May 22, 2026 13:114,32620,002,7229,436,0001,379,0002,113,536