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 listJul 31, 2024 04:12Henry CafaroHenry CafaroScore: 19,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2024 04:1219,198699,700,001633,525,48402,281,472
2Jul 31, 2024 04:1219,241698,627,866634,948,56402,281,472
3Jul 31, 2024 04:1219,271711,502,118635,935,52502,277,376
4Jul 31, 2024 04:1219,326703,156,507637,755,08302,277,376
5Jul 31, 2024 04:1219,383718,982,939639,633,86002,277,376
6Jul 31, 2024 04:1220,169720,762,858665,581,46202,273,280