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 listSep 3, 2024 20:48Jatin YadavJatin YadavScore: 189,120Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 20:49189,0246,262,401,6446,235,793,0001,998,0002,277,376
2Sep 3, 2024 20:49189,0446,264,841,5186,236,465,0001,998,0002,277,376
3Sep 3, 2024 20:48189,0706,266,083,4286,238,326,000999,0002,281,472
4Sep 3, 2024 20:48189,1206,273,581,2616,238,965,0001,998,0002,277,376
5Sep 3, 2024 20:49189,2106,269,992,6286,240,944,0002,998,0002,277,376
6Sep 3, 2024 20:48189,5756,288,823,7886,252,971,0002,997,0002,285,568