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 listAug 29, 2022 17:32eldon-chungeldon-chungScore: 38,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2022 17:3238,2661,325,362,7081,262,776,33202,297,856
2Aug 29, 2022 17:3238,3221,324,244,6331,264,634,05402,293,760
3Aug 29, 2022 17:3238,3511,325,187,2501,265,583,28902,293,760
4Aug 29, 2022 17:3238,4011,342,571,3611,267,248,59102,293,760
5Aug 29, 2022 17:3238,4131,332,502,0381,267,630,09902,293,760
6Aug 29, 2022 17:3239,5371,372,089,7871,304,728,54102,281,472