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 listApr 27, 2025 12:26Dmitry YudakovDmitry YudakovScore: 107,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2025 12:26104,7353,487,964,1713,431,277,00024,987,0002,371,584
2Apr 27, 2025 12:26107,7833,584,402,7813,536,858,00019,987,0002,301,952
3Apr 27, 2025 12:26112,0553,728,207,8233,683,809,00013,991,0002,490,368