Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listOct 14, 2025 16:08Nguyen Thanh VinhNguyen Thanh VinhScore: 329,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2025 16:08327,28310,831,647,81710,706,384,00093,941,0002,416,640
2Oct 14, 2025 16:08329,58910,913,978,46410,792,505,00083,941,0002,260,992
3Oct 14, 2025 16:08332,29610,996,715,22810,864,819,000100,942,0002,383,872