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 listApr 19, 2026 05:11olliecrowolliecrowScore: 5,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 05:115,25329,412,31811,113,0002,020,0002,314,240
2Apr 19, 2026 05:115,25537,927,12111,116,0002,021,0002,281,472
3Apr 19, 2026 05:115,41634,573,70011,457,0002,083,0002,289,664