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:49Dmitry YudakovDmitry YudakovScore: 106,579Success
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:49103,9523,459,036,8473,412,431,00017,991,0002,416,640
2Apr 27, 2025 12:49106,5793,547,819,4243,505,117,00011,993,0002,494,464
3Apr 27, 2025 12:49107,1243,561,577,7443,521,093,00013,992,0002,306,048