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 listOct 11, 2022 17:31Kenneth MaplesKenneth MaplesScore: 93,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2022 17:3193,1723,139,303,5573,074,683,27502,289,664
2Oct 11, 2022 17:3093,2043,150,331,9053,075,737,44202,297,856
3Oct 11, 2022 17:3093,4913,146,450,3813,085,211,36602,306,048
4Oct 11, 2022 17:3193,8603,164,307,0323,097,381,26402,301,952
5Oct 11, 2022 17:3094,0893,175,599,8753,104,922,64602,293,760
6Oct 11, 2022 17:3194,3293,184,163,6623,112,843,60402,297,856