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 15, 2023 15:26Oleg KovalovOleg KovalovScore: 99,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 10:4098,3033,306,025,1073,243,989,63402,211,840
2Dec 15, 2023 10:4098,5773,312,653,4453,253,052,29102,220,032
3Dec 15, 2023 15:2698,8993,318,797,8223,263,656,26102,224,128
4Dec 15, 2023 15:2699,2053,335,191,7653,273,755,30502,228,224
5Dec 15, 2023 15:2699,4883,351,856,9823,283,113,09102,207,744
6Dec 15, 2023 10:4099,8733,372,803,0433,295,809,26102,203,648