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 listJan 9, 2025 09:58Ian MckibbenIan MckibbenScore: 160,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:58158,7425,275,590,8525,211,508,00026,981,0002,416,640
2Jan 9, 2025 09:58159,0925,277,501,3815,224,067,00025,985,0002,424,832
3Jan 9, 2025 09:58159,5815,310,781,7985,235,203,00030,983,0002,506,752
4Jan 9, 2025 09:58159,6245,303,495,6375,249,589,00017,991,0002,412,544
5Jan 9, 2025 09:58160,5575,327,484,3255,278,392,00019,986,0002,449,408
6Jan 9, 2025 09:58160,6935,338,413,7565,280,881,00021,987,0002,351,104
7Jan 9, 2025 09:58160,7885,332,949,6075,283,011,00022,986,0002,359,296
8Jan 9, 2025 09:58162,2165,387,128,5515,328,139,00024,986,0002,437,120
9Jan 9, 2025 09:58162,6755,401,242,1385,339,292,00028,979,0002,375,680