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 listDec 29, 2024 05:21Yuriy LyfenkoYuriy LyfenkoScore: 31,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 05:2131,8391,076,664,5601,043,680,0006,997,0002,473,984
2Dec 29, 2024 05:2131,9221,079,034,2451,046,440,0006,996,0002,289,664
3Dec 29, 2024 05:2131,9711,078,955,2871,049,049,0005,994,0002,281,472