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 11, 2025 00:02Ian MckibbenIan MckibbenScore: 86,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 00:0285,6482,857,220,9812,796,407,00029,982,0002,506,752
2Jan 11, 2025 00:0285,8322,859,985,0782,811,478,00020,988,0002,404,352
3Jan 11, 2025 00:0285,8902,865,107,5722,810,370,00023,986,0002,502,656
4Jan 11, 2025 00:0286,2672,876,695,0992,821,824,00024,989,0002,375,680
5Jan 11, 2025 00:0286,5172,880,211,8282,830,089,00024,983,0002,478,080
6Jan 11, 2025 00:0286,6272,882,974,8412,834,697,00023,988,0002,469,888
7Jan 11, 2025 00:0286,8772,896,904,8992,844,954,00021,984,0002,392,064
8Jan 11, 2025 00:0289,0122,969,954,9752,905,403,00031,982,0002,490,368
9Jan 11, 2025 00:0289,4952,984,166,0252,926,345,00026,984,0002,498,560