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:30Dmitry YudakovDmitry YudakovScore: 104,370Success
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:30103,3873,441,546,4363,392,785,00018,987,0002,453,504
2Apr 27, 2025 12:30104,3703,479,865,3453,426,211,00017,990,0002,482,176
3Apr 27, 2025 12:30104,8153,488,344,2923,447,916,00010,993,0002,367,488