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 listFeb 7, 2025 21:44E SequeiraE SequeiraScore: 74,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2025 21:4474,0492,469,086,4982,421,625,00021,987,0002,387,968
2Nov 23, 2024 15:0974,0782,478,752,2512,415,600,00028,983,0002,523,136
3Nov 23, 2024 15:0974,1762,473,985,0672,425,816,00021,989,0002,514,944
4Feb 7, 2025 21:4474,8382,498,113,7232,447,669,00021,988,0002,281,472
5Nov 23, 2024 15:0974,8752,509,235,9462,450,891,00019,982,0002,281,472
6Feb 7, 2025 21:4475,2602,513,823,0672,462,588,00020,979,0002,359,296