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 listSep 3, 2024 19:27Jatin YadavJatin YadavScore: 59,574Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 19:2755,5881,866,213,6181,825,413,0008,997,0002,502,656
2Sep 3, 2024 19:2759,5741,990,781,7071,956,963,0008,995,0002,519,040
3Sep 3, 2024 19:2761,7402,065,706,8392,029,438,0007,993,0002,277,376