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 17, 2026 01:58olliecrowolliecrowScore: 4,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 01:584,91435,966,08111,261,0001,023,0002,465,792
2Apr 17, 2026 01:584,92333,264,79512,307,00002,449,408
3Apr 17, 2026 01:585,19932,985,24011,998,000999,0002,363,392