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 listJul 12, 2025 17:10Aniruddha DebAniruddha DebScore: 376,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2025 17:10376,45012,456,381,06412,318,897,000103,940,0002,437,120
2Jul 12, 2025 17:10376,50512,456,607,84712,319,713,000104,937,0002,514,944
3Jul 12, 2025 17:10378,05912,507,446,51012,368,025,000107,930,0002,461,696