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 5, 2026 00:41olliecrowolliecrowScore: 3,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:463,71424,048,2637,999,0001,286,0002,387,968
2May 5, 2026 00:463,72325,398,3488,025,0001,284,0002,383,872
3May 5, 2026 00:463,73626,063,4908,079,0001,262,0002,400,256
4May 5, 2026 00:463,74427,441,5728,067,0001,295,0002,404,352
5May 5, 2026 00:463,75527,116,6568,097,0001,291,0002,392,064
6May 5, 2026 00:463,76626,451,9507,115,0002,300,0002,387,968
7May 5, 2026 00:463,86527,312,6007,365,0002,299,0002,400,256
8May 5, 2026 00:463,88125,457,7798,441,0001,262,0002,400,256
9May 5, 2026 00:463,97226,267,5417,399,0002,531,0002,404,352